./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:27:30,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:27:30,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:27:30,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:27:30,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:27:30,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:27:30,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:27:30,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:27:30,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:27:30,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:27:30,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:27:30,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:27:30,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:27:30,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:30,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:27:30,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:27:30,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:27:30,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:27:30,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:27:30,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade [2025-03-08 14:27:30,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:27:30,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:27:30,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:27:30,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:27:30,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:27:30,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-08 14:27:32,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95f519e49/660dda974a8a4e318ce88a52f440183a/FLAG9b4ef05cc [2025-03-08 14:27:32,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:27:32,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-08 14:27:32,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95f519e49/660dda974a8a4e318ce88a52f440183a/FLAG9b4ef05cc [2025-03-08 14:27:32,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95f519e49/660dda974a8a4e318ce88a52f440183a [2025-03-08 14:27:32,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:27:32,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:27:32,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:32,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:27:32,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:27:32,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32, skipping insertion in model container [2025-03-08 14:27:32,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:27:32,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-08 14:27:32,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:32,524 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:27:32,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-08 14:27:32,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:32,575 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:27:32,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32 WrapperNode [2025-03-08 14:27:32,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:32,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:32,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:27:32,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:27:32,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,615 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-08 14:27:32,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:32,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:27:32,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:27:32,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:27:32,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:27:32,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:27:32,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:27:32,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:27:32,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:27:32,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (1/1) ... [2025-03-08 14:27:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:32,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:32,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:27:32,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:27:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:27:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:27:32,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:27:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:27:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:27:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:27:32,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:27:32,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:27:32,948 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:27:32,948 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:27:32,956 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:27:32,958 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:27:32,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:32 BoogieIcfgContainer [2025-03-08 14:27:32,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:27:32,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:27:32,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:27:32,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:27:32,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:27:32" (1/3) ... [2025-03-08 14:27:32,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd6a316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:27:32, skipping insertion in model container [2025-03-08 14:27:32,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:32" (2/3) ... [2025-03-08 14:27:32,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd6a316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:27:32, skipping insertion in model container [2025-03-08 14:27:32,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:32" (3/3) ... [2025-03-08 14:27:32,968 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-08 14:27:32,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:27:32,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:27:33,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:27:33,038 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28e66cd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:27:33,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:27:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:27:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:27:33,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:33,050 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:33,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:33,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1572048080, now seen corresponding path program 1 times [2025-03-08 14:27:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:27:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015456924] [2025-03-08 14:27:33,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:27:33,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:33,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:33,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:33,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 14:27:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:27:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015456924] [2025-03-08 14:27:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015456924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:27:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068786820] [2025-03-08 14:27:33,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:27:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:33,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:27:33,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:27:33,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:33,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:33,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:33,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:33,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:27:33,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:27:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 14:27:33,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:27:33,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068786820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:27:33,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:27:33,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:27:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80409277] [2025-03-08 14:27:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:27:33,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:27:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:27:33,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:27:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:27:33,447 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:27:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:27:33,466 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2025-03-08 14:27:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:27:33,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-03-08 14:27:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:27:33,475 INFO L225 Difference]: With dead ends: 113 [2025-03-08 14:27:33,475 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 14:27:33,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:27:33,481 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:27:33,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:27:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 14:27:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 14:27:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:27:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-08 14:27:33,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-03-08 14:27:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:27:33,513 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-08 14:27:33,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:27:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-08 14:27:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:27:33,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:33,518 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:33,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:27:33,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:27:33,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:33,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1489414067, now seen corresponding path program 1 times [2025-03-08 14:27:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:27:33,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-08 14:27:33,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:27:33,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:33,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:27:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:27:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-08 14:27:34,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350456147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:27:34,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:27:34,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:27:34,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603276118] [2025-03-08 14:27:34,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:27:34,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:27:34,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:27:34,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:27:34,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:27:34,069 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:27:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:27:34,112 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2025-03-08 14:27:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:27:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2025-03-08 14:27:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:27:34,116 INFO L225 Difference]: With dead ends: 159 [2025-03-08 14:27:34,116 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 14:27:34,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:27:34,117 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:27:34,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:27:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 14:27:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-08 14:27:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 14:27:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2025-03-08 14:27:34,139 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2025-03-08 14:27:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:27:34,141 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2025-03-08 14:27:34,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:27:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2025-03-08 14:27:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:27:34,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:34,142 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:34,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:27:34,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:34,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash -601910386, now seen corresponding path program 1 times [2025-03-08 14:27:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:27:34,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134428735] [2025-03-08 14:27:34,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:34,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:27:34,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:34,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:34,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:34,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:27:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035962910] [2025-03-08 14:27:34,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:27:34,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:34,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:27:34,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:27:34,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:34,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:34,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:34,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:27:34,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:27:34,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:34,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:34,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:34,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:27:34,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:27:34,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:27:34,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:27:34,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 14:27:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 14:27:34,604 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:27:34,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:27:34,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:27:34 BoogieIcfgContainer [2025-03-08 14:27:34,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:27:34,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:27:34,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:27:34,678 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:27:34,679 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:32" (3/4) ... [2025-03-08 14:27:34,681 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:27:34,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:27:34,682 INFO L158 Benchmark]: Toolchain (without parser) took 2342.92ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 95.4MB in the end (delta: 57.4MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-03-08 14:27:34,683 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:34,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.94ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 139.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:27:34,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.38ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 137.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:34,684 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 134.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:34,684 INFO L158 Benchmark]: IcfgBuilder took 295.39ms. Allocated memory is still 201.3MB. Free memory was 134.9MB in the beginning and 117.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:27:34,684 INFO L158 Benchmark]: TraceAbstraction took 1715.50ms. Allocated memory is still 201.3MB. Free memory was 117.1MB in the beginning and 95.5MB in the end (delta: 21.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2025-03-08 14:27:34,684 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 201.3MB. Free memory was 95.5MB in the beginning and 95.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:27:34,685 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.94ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 139.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.38ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 137.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 134.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 295.39ms. Allocated memory is still 201.3MB. Free memory was 134.9MB in the beginning and 117.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1715.50ms. Allocated memory is still 201.3MB. Free memory was 117.1MB in the beginning and 95.5MB in the end (delta: 21.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 201.3MB. Free memory was 95.5MB in the beginning and 95.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryArithmeticFLOAToperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] float var_1_10 = 0.125; [L32] signed long int var_1_11 = 50; [L33] float var_1_12 = 1000000000000.45; [L34] float var_1_13 = 128.5; [L35] float var_1_14 = 10000000.625; [L36] signed char var_1_15 = -5; [L37] signed char var_1_16 = 10; VAL [isInitial=0, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] int k_loop; [L113] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L113] COND TRUE k_loop < 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_ushort() [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1/8, var_1_11=50, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L91] var_1_11 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_12=20000000000009/20, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_13=257/2, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=10, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L115] RET updateVariables() [L116] CALL step() [L41] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L42] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_14=80000005/8, var_1_15=-5, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L47] var_1_14 = var_1_12 [L48] var_1_15 = var_1_16 VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=8, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L49] COND FALSE !(! var_1_5) [L52] var_1_1 = var_1_4 VAL [isInitial=1, stepLocal_0=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_1 = -2 / var_1_11; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=1/8, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L55] COND TRUE stepLocal_1 > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1) [L56] var_1_10 = ((var_1_12 - var_1_13) + 9.8f) VAL [isInitial=1, stepLocal_0=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L116] RET step() [L117] CALL, EXPR property() [L106-L107] return (((((! var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && (var_1_7 || var_1_8)) ? (var_1_5 == ((unsigned char) var_1_9)) : 1) : 1)) && (((-2 / var_1_11) > (((((var_1_4) > (var_1_3)) ? (var_1_4) : (var_1_3))) * var_1_1)) ? (var_1_10 == ((float) ((var_1_12 - var_1_13) + 9.8f))) : (var_1_5 ? (var_1_5 ? (var_1_10 == ((float) var_1_12)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_12))))) && (var_1_14 == ((float) var_1_12))) && (var_1_15 == ((signed char) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_14=2, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 107 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 161 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:27:34,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:27:36,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:27:36,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:27:36,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:27:36,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:27:36,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:27:36,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:27:36,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:27:36,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:27:36,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:27:36,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:27:36,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:27:36,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:27:36,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:27:36,635 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:27:36,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:27:36,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:27:36,635 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:27:36,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:27:36,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:27:36,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:27:36,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:27:36,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:27:36,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:27:36,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:36,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:27:36,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99789bff671c1bff838a649be3936d6a549d150e85cee8347f1efba817c85ade [2025-03-08 14:27:36,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:27:36,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:27:36,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:27:36,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:27:36,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:27:36,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-08 14:27:38,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8146c9a8e/14ed3d37c03047d2bb135073108883d8/FLAG9343adb8a [2025-03-08 14:27:38,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:27:38,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-08 14:27:38,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8146c9a8e/14ed3d37c03047d2bb135073108883d8/FLAG9343adb8a [2025-03-08 14:27:38,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8146c9a8e/14ed3d37c03047d2bb135073108883d8 [2025-03-08 14:27:38,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:27:38,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:27:38,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:38,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:27:38,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:27:38,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38, skipping insertion in model container [2025-03-08 14:27:38,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:27:38,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-08 14:27:38,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:38,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:27:38,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-96.i[915,928] [2025-03-08 14:27:38,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:27:38,492 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:27:38,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38 WrapperNode [2025-03-08 14:27:38,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:27:38,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:38,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:27:38,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:27:38,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,516 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-08 14:27:38,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:27:38,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:27:38,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:27:38,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:27:38,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:27:38,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:27:38,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:27:38,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:27:38,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:27:38,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (1/1) ... [2025-03-08 14:27:38,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:27:38,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:27:38,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:27:38,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:27:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:27:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:27:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:27:38,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:27:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:27:38,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:27:38,668 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:27:38,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:27:39,589 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:27:39,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:27:39,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:27:39,598 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:27:39,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:39 BoogieIcfgContainer [2025-03-08 14:27:39,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:27:39,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:27:39,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:27:39,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:27:39,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:27:38" (1/3) ... [2025-03-08 14:27:39,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c6f3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:27:39, skipping insertion in model container [2025-03-08 14:27:39,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:27:38" (2/3) ... [2025-03-08 14:27:39,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c6f3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:27:39, skipping insertion in model container [2025-03-08 14:27:39,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:27:39" (3/3) ... [2025-03-08 14:27:39,607 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i [2025-03-08 14:27:39,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:27:39,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-96.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:27:39,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:27:39,671 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10e938cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:27:39,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:27:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:27:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:27:39,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:39,687 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:39,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1572048080, now seen corresponding path program 1 times [2025-03-08 14:27:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:27:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921409397] [2025-03-08 14:27:39,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:39,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:27:39,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:27:39,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:27:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:27:39,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:39,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:39,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:39,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:39,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:27:39,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:27:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-08 14:27:39,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:27:39,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:27:39,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921409397] [2025-03-08 14:27:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921409397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:27:39,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:27:39,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:27:39,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549283991] [2025-03-08 14:27:39,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:27:39,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:27:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:27:39,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:27:39,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:27:39,972 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:27:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:27:39,986 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2025-03-08 14:27:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:27:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-03-08 14:27:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:27:39,992 INFO L225 Difference]: With dead ends: 113 [2025-03-08 14:27:39,992 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 14:27:39,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:27:39,996 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:27:39,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:27:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 14:27:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 14:27:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:27:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-08 14:27:40,038 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-03-08 14:27:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:27:40,038 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-08 14:27:40,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:27:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-08 14:27:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:27:40,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:40,041 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:40,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:27:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:27:40,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:40,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1489414067, now seen corresponding path program 1 times [2025-03-08 14:27:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:27:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942090271] [2025-03-08 14:27:40,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:40,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:27:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:27:40,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:27:40,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:27:40,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:40,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:40,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:40,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:27:40,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:27:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:27:40,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:27:40,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:27:40,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942090271] [2025-03-08 14:27:40,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942090271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:27:40,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:27:40,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:27:40,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618268969] [2025-03-08 14:27:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:27:40,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:27:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:27:40,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:27:40,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:27:40,739 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:27:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:27:41,523 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2025-03-08 14:27:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:27:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 130 [2025-03-08 14:27:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:27:41,527 INFO L225 Difference]: With dead ends: 159 [2025-03-08 14:27:41,529 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 14:27:41,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:27:41,531 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:27:41,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:27:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 14:27:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-08 14:27:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 14:27:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2025-03-08 14:27:41,562 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2025-03-08 14:27:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:27:41,562 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2025-03-08 14:27:41,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:27:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2025-03-08 14:27:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:27:41,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:27:41,565 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:27:41,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:27:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:27:41,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:27:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:27:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash -601910386, now seen corresponding path program 1 times [2025-03-08 14:27:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:27:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741948859] [2025-03-08 14:27:41,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:27:41,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:27:41,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:27:41,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:27:41,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:27:41,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:27:42,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:27:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:27:42,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:27:42,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 14:27:42,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:05,127 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)