./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_50-while_file-25.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 26fa746570883aea24cbbb132b9b9fcf9223302a77c6a16f3d97e91a2338fe8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:41:06,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:41:06,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:41:06,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:41:06,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:41:06,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:41:06,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:41:06,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:41:06,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:41:06,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:41:06,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:41:06,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:41:06,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:41:06,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:41:06,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:41:06,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:41:06,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:41:06,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:41:06,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:41:06,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:41:06,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:41:06,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:41:06,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:41:06,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:41:06,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:41:06,318 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 -> 26fa746570883aea24cbbb132b9b9fcf9223302a77c6a16f3d97e91a2338fe8d [2025-03-03 23:41:06,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:41:06,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:41:06,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:41:06,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:41:06,572 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:41:06,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-25.i [2025-03-03 23:41:07,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706c71fd4/3798a2ee998d4571975126875d6844e4/FLAGf700350fa [2025-03-03 23:41:08,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:41:08,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-25.i [2025-03-03 23:41:08,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706c71fd4/3798a2ee998d4571975126875d6844e4/FLAGf700350fa [2025-03-03 23:41:08,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706c71fd4/3798a2ee998d4571975126875d6844e4 [2025-03-03 23:41:08,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:41:08,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:41:08,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:41:08,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:41:08,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:41:08,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eb0951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08, skipping insertion in model container [2025-03-03 23:41:08,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:41:08,160 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_50-while_file-25.i[915,928] [2025-03-03 23:41:08,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:41:08,223 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:41:08,234 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_50-while_file-25.i[915,928] [2025-03-03 23:41:08,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:41:08,272 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:41:08,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08 WrapperNode [2025-03-03 23:41:08,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:41:08,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:41:08,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:41:08,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:41:08,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,301 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-03 23:41:08,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:41:08,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:41:08,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:41:08,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:41:08,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,321 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-03 23:41:08,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:41:08,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:41:08,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:41:08,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:41:08,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (1/1) ... [2025-03-03 23:41:08,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:41:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:41:08,362 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-03 23:41:08,370 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-03 23:41:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:41:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:41:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:41:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:41:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:41:08,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:41:08,447 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:41:08,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:41:08,665 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 23:41:08,665 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:41:08,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:41:08,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:41:08,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:41:08 BoogieIcfgContainer [2025-03-03 23:41:08,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:41:08,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:41:08,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:41:08,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:41:08,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:41:08" (1/3) ... [2025-03-03 23:41:08,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc4adb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:41:08, skipping insertion in model container [2025-03-03 23:41:08,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:08" (2/3) ... [2025-03-03 23:41:08,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc4adb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:41:08, skipping insertion in model container [2025-03-03 23:41:08,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:41:08" (3/3) ... [2025-03-03 23:41:08,679 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-25.i [2025-03-03 23:41:08,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:41:08,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-25.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:41:08,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:41:08,743 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;@6bbb3c24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:41:08,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:41:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:41:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 23:41:08,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:41:08,753 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:41:08,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:41:08,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:41:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1803787500, now seen corresponding path program 1 times [2025-03-03 23:41:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:41:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555843576] [2025-03-03 23:41:08,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:41:08,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 23:41:08,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 23:41:08,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:08,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:41:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 23:41:08,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:41:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555843576] [2025-03-03 23:41:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555843576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:41:08,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226413647] [2025-03-03 23:41:08,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:08,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:41:08,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:41:08,967 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-03 23:41:08,968 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-03 23:41:09,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 23:41:09,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 23:41:09,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:09,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:41:09,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:41:09,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:41:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 23:41:09,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:41:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226413647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:41:09,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:41:09,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:41:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192174342] [2025-03-03 23:41:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:41:09,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:41:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:41:09,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:41:09,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:41:09,134 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:41:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:41:09,149 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2025-03-03 23:41:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:41:09,151 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2025-03-03 23:41:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:41:09,157 INFO L225 Difference]: With dead ends: 100 [2025-03-03 23:41:09,158 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 23:41:09,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-03 23:41:09,164 INFO L435 NwaCegarLoop]: 72 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, 72 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-03 23:41:09,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:41:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 23:41:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 23:41:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:41:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-03 23:41:09,201 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 87 [2025-03-03 23:41:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:41:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-03 23:41:09,202 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:41:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-03 23:41:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 23:41:09,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:41:09,205 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:41:09,213 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-03 23:41:09,413 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-03 23:41:09,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:41:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:41:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 380124278, now seen corresponding path program 1 times [2025-03-03 23:41:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:41:09,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429126625] [2025-03-03 23:41:09,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:09,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:41:09,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 23:41:09,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 23:41:09,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:09,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:41:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 23:41:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:41:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429126625] [2025-03-03 23:41:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429126625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:41:09,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:41:09,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:41:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634896245] [2025-03-03 23:41:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:41:09,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:41:09,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:41:09,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:41:09,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:41:09,770 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 23:41:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:41:09,870 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2025-03-03 23:41:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:41:09,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-03 23:41:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:41:09,873 INFO L225 Difference]: With dead ends: 96 [2025-03-03 23:41:09,873 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 23:41:09,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:41:09,874 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 72 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:41:09,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 112 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:41:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 23:41:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 23:41:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:41:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-03-03 23:41:09,883 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 87 [2025-03-03 23:41:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:41:09,884 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-03 23:41:09,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 23:41:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2025-03-03 23:41:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 23:41:09,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:41:09,885 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:41:09,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:41:09,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:41:09,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:41:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash -516818675, now seen corresponding path program 1 times [2025-03-03 23:41:09,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:41:09,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442091841] [2025-03-03 23:41:09,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:09,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:41:09,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 23:41:09,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 23:41:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:41:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463724405] [2025-03-03 23:41:09,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:09,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:41:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:41:09,985 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-03 23:41:09,987 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-03 23:41:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 23:41:10,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 23:41:10,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:10,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:41:10,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:41:10,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 23:41:10,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 23:41:10,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:10,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:41:10,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:41:10,148 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:41:10,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:41:10,159 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-03 23:41:10,350 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-03 23:41:10,352 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:41:10,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:41:10,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:41:10 BoogieIcfgContainer [2025-03-03 23:41:10,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:41:10,414 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:41:10,414 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:41:10,414 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:41:10,414 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:41:08" (3/4) ... [2025-03-03 23:41:10,416 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:41:10,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:41:10,417 INFO L158 Benchmark]: Toolchain (without parser) took 2386.84ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 84.3MB in the end (delta: 29.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-03 23:41:10,417 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:41:10,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.18ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:41:10,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.37ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:41:10,418 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:41:10,418 INFO L158 Benchmark]: IcfgBuilder took 336.35ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 73.5MB in the end (delta: 18.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:41:10,418 INFO L158 Benchmark]: TraceAbstraction took 1739.77ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 84.3MB in the end (delta: -11.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:41:10,418 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 84.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:41:10,419 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.32ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.18ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.37ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 336.35ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 73.5MB in the end (delta: 18.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1739.77ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 84.3MB in the end (delta: -11.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 84.3MB in the end (delta: 24.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 118, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] signed long int last_1_var_1_1 = -256; [L40] signed short int last_1_var_1_5 = -256; [L41] unsigned char last_1_var_1_10 = 0; [L42] unsigned short int last_1_var_1_19 = 5; [L43] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L124] last_1_var_1_1 = var_1_1 [L125] last_1_var_1_5 = var_1_5 [L126] last_1_var_1_10 = var_1_10 [L127] last_1_var_1_19 = var_1_19 [L128] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L102] var_1_7 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L103] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256, var_1_8=639/5] [L104] var_1_8 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L105] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L108] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L108] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L111] var_1_14 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L112] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L113] var_1_15 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L114] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L115] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L115] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L116] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L116] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L117] var_1_16 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L118] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L121] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L121] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L139] RET updateVariables() [L140] CALL step() [L47] signed long int stepLocal_2 = last_1_var_1_5; [L48] unsigned char stepLocal_1 = last_1_var_1_10; [L49] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L50] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L55] COND TRUE last_1_var_1_1 >= stepLocal_2 [L56] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L61] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L62] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_5=-256] [L67] var_1_22 = last_1_var_1_22 [L68] var_1_23 = var_1_14 [L69] unsigned char stepLocal_5 = var_1_10; [L70] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=51, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_5=-256] [L71] COND TRUE var_1_22 < stepLocal_4 [L72] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_5=-256] [L80] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L81] COND TRUE ! (var_1_23 <= var_1_7) [L82] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L90] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L91] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=-256] [L94] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L95] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=15, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 128 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 437 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 770/792 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-03 23:41:10,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_50-while_file-25.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 26fa746570883aea24cbbb132b9b9fcf9223302a77c6a16f3d97e91a2338fe8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:41:12,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:41:12,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:41:12,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:41:12,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:41:12,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:41:12,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:41:12,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:41:12,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:41:12,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:41:12,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:41:12,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:41:12,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:41:12,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:41:12,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:41:12,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:41:12,385 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:41:12,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:41:12,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:41:12,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:41:12,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:41:12,386 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 -> 26fa746570883aea24cbbb132b9b9fcf9223302a77c6a16f3d97e91a2338fe8d [2025-03-03 23:41:12,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:41:12,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:41:12,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:41:12,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:41:12,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:41:12,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-25.i [2025-03-03 23:41:13,888 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfef0182/fcdf5ae10053497c869e9b9c77c10f38/FLAGc9cac22de [2025-03-03 23:41:14,102 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:41:14,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-25.i [2025-03-03 23:41:14,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfef0182/fcdf5ae10053497c869e9b9c77c10f38/FLAGc9cac22de [2025-03-03 23:41:14,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfef0182/fcdf5ae10053497c869e9b9c77c10f38 [2025-03-03 23:41:14,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:41:14,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:41:14,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:41:14,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:41:14,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:41:14,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2673be8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14, skipping insertion in model container [2025-03-03 23:41:14,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:41:14,255 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_50-while_file-25.i[915,928] [2025-03-03 23:41:14,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:41:14,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:41:14,321 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_50-while_file-25.i[915,928] [2025-03-03 23:41:14,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:41:14,351 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:41:14,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14 WrapperNode [2025-03-03 23:41:14,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:41:14,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:41:14,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:41:14,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:41:14,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,388 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-03 23:41:14,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:41:14,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:41:14,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:41:14,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:41:14,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,411 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-03 23:41:14,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:41:14,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:41:14,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:41:14,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:41:14,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (1/1) ... [2025-03-03 23:41:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:41:14,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:41:14,458 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-03 23:41:14,462 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-03 23:41:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:41:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:41:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:41:14,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:41:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:41:14,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:41:14,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:41:14,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:41:16,066 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 23:41:16,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:41:16,075 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:41:16,075 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:41:16,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:41:16 BoogieIcfgContainer [2025-03-03 23:41:16,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:41:16,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:41:16,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:41:16,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:41:16,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:41:14" (1/3) ... [2025-03-03 23:41:16,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f16daa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:41:16, skipping insertion in model container [2025-03-03 23:41:16,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:41:14" (2/3) ... [2025-03-03 23:41:16,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f16daa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:41:16, skipping insertion in model container [2025-03-03 23:41:16,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:41:16" (3/3) ... [2025-03-03 23:41:16,083 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-25.i [2025-03-03 23:41:16,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:41:16,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-25.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:41:16,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:41:16,154 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;@7e4860e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:41:16,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:41:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:41:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 23:41:16,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:41:16,163 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:41:16,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:41:16,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:41:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1803787500, now seen corresponding path program 1 times [2025-03-03 23:41:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:41:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203345555] [2025-03-03 23:41:16,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:16,174 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-03 23:41:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:41:16,176 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-03 23:41:16,179 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-03 23:41:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 23:41:16,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 23:41:16,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:16,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:41:16,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:41:16,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:41:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 23:41:16,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:41:16,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:41:16,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203345555] [2025-03-03 23:41:16,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203345555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:41:16,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:41:16,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:41:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883797815] [2025-03-03 23:41:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:41:16,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:41:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:41:16,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:41:16,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:41:16,419 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:41:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:41:16,431 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2025-03-03 23:41:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:41:16,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2025-03-03 23:41:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:41:16,439 INFO L225 Difference]: With dead ends: 100 [2025-03-03 23:41:16,439 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 23:41:16,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-03 23:41:16,443 INFO L435 NwaCegarLoop]: 72 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, 72 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-03 23:41:16,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:41:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 23:41:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 23:41:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:41:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-03 23:41:16,467 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 87 [2025-03-03 23:41:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:41:16,468 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-03 23:41:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:41:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-03 23:41:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 23:41:16,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:41:16,470 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:41:16,477 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-03 23:41:16,674 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-03 23:41:16,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:41:16,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:41:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash 380124278, now seen corresponding path program 1 times [2025-03-03 23:41:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:41:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992045964] [2025-03-03 23:41:16,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:16,675 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-03 23:41:16,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:41:16,679 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-03 23:41:16,680 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-03 23:41:16,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 23:41:16,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 23:41:16,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:16,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:41:16,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:41:16,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:41:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 23:41:17,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:41:17,088 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:41:17,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992045964] [2025-03-03 23:41:17,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992045964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:41:17,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:41:17,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:41:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31737415] [2025-03-03 23:41:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:41:17,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:41:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:41:17,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:41:17,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:41:17,090 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 23:41:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:41:17,641 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2025-03-03 23:41:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:41:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-03 23:41:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:41:17,656 INFO L225 Difference]: With dead ends: 96 [2025-03-03 23:41:17,656 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 23:41:17,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:41:17,657 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:41:17,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 112 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:41:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 23:41:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 23:41:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:41:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-03-03 23:41:17,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 87 [2025-03-03 23:41:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:41:17,669 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-03 23:41:17,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 23:41:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2025-03-03 23:41:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 23:41:17,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:41:17,671 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:41:17,677 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 (3)] Ended with exit code 0 [2025-03-03 23:41:17,871 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-03 23:41:17,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:41:17,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:41:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -516818675, now seen corresponding path program 1 times [2025-03-03 23:41:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:41:17,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609349077] [2025-03-03 23:41:17,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:41:17,873 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-03 23:41:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:41:17,874 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-03 23:41:17,876 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-03 23:41:17,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 23:41:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 23:41:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:41:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:41:18,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 23:41:18,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:42:15,676 WARN L286 SmtUtils]: Spent 15.36s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)