./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.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-1loop_file-55.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 de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:33:33,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:33:33,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:33:33,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:33:33,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:33:33,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:33:33,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:33:33,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:33:33,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:33:33,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:33:33,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:33:33,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:33:33,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:33:33,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:33:33,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:33:33,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:33:33,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:33:33,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:33:33,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:33:33,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:33:33,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:33:33,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:33:33,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:33:33,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:33:33,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:33:33,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:33:33,547 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 -> de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 [2025-03-03 23:33:33,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:33:33,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:33:33,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:33:33,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:33:33,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:33:33,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2025-03-03 23:33:34,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480393909/013563c5cbe046509a8fd15c26895deb/FLAGf947e7bf4 [2025-03-03 23:33:35,175 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:33:35,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2025-03-03 23:33:35,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480393909/013563c5cbe046509a8fd15c26895deb/FLAGf947e7bf4 [2025-03-03 23:33:35,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480393909/013563c5cbe046509a8fd15c26895deb [2025-03-03 23:33:35,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:33:35,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:33:35,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:33:35,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:33:35,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:33:35,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35, skipping insertion in model container [2025-03-03 23:33:35,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:33:35,322 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-1loop_file-55.i[915,928] [2025-03-03 23:33:35,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:33:35,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:33:35,398 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-1loop_file-55.i[915,928] [2025-03-03 23:33:35,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:33:35,448 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:33:35,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35 WrapperNode [2025-03-03 23:33:35,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:33:35,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:33:35,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:33:35,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:33:35,454 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:33:35" (1/1) ... [2025-03-03 23:33:35,467 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:33:35" (1/1) ... [2025-03-03 23:33:35,492 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-03 23:33:35,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:33:35,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:33:35,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:33:35,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:33:35,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,510 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:33:35,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:33:35,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:33:35,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:33:35,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:33:35,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (1/1) ... [2025-03-03 23:33:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:33:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:33:35,550 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:33:35,553 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:33:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:33:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:33:35,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:33:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:33:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:33:35,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:33:35,634 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:33:35,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:33:35,878 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:33:35,878 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:33:35,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:33:35,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:33:35,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:35 BoogieIcfgContainer [2025-03-03 23:33:35,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:33:35,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:33:35,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:33:35,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:33:35,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:33:35" (1/3) ... [2025-03-03 23:33:35,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c8e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:35, skipping insertion in model container [2025-03-03 23:33:35,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:35" (2/3) ... [2025-03-03 23:33:35,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c8e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:35, skipping insertion in model container [2025-03-03 23:33:35,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:35" (3/3) ... [2025-03-03 23:33:35,896 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i [2025-03-03 23:33:35,907 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:33:35,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:33:35,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:33:35,962 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;@126863ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:33:35,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:33:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:35,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:35,978 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:35,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:35,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1645415873, now seen corresponding path program 1 times [2025-03-03 23:33:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:33:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129342813] [2025-03-03 23:33:35,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:33:36,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:36,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:36,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:36,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 23:33:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:33:36,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129342813] [2025-03-03 23:33:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129342813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:33:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127358590] [2025-03-03 23:33:36,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:33:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:33:36,298 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:33:36,299 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:33:36,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:36,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:36,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:36,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:33:36,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:33:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 23:33:36,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:33:36,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127358590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:33:36,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:33:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:33:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922939275] [2025-03-03 23:33:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:33:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:33:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:33:36,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:33:36,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:33:36,532 INFO L87 Difference]: Start difference. First operand has 73 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 23:33:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:33:36,549 INFO L93 Difference]: Finished difference Result 143 states and 252 transitions. [2025-03-03 23:33:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:33:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2025-03-03 23:33:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:33:36,554 INFO L225 Difference]: With dead ends: 143 [2025-03-03 23:33:36,554 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:33:36,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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:33:36,558 INFO L435 NwaCegarLoop]: 109 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, 109 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:33:36,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:33:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:33:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 23:33:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 23:33:36,594 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 186 [2025-03-03 23:33:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:33:36,594 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 23:33:36,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 23:33:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 23:33:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:36,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:36,599 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,606 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:33:36,800 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:33:36,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:36,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:36,801 INFO L85 PathProgramCache]: Analyzing trace with hash 933247300, now seen corresponding path program 1 times [2025-03-03 23:33:36,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:33:36,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670563661] [2025-03-03 23:33:36,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:36,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:33:36,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:36,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:36,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:36,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 78 proven. 12 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 23:33:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:33:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670563661] [2025-03-03 23:33:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670563661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:33:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218774696] [2025-03-03 23:33:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:33:37,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:33:37,498 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:33:37,500 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:33:37,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:37,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:37,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:37,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:37,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:33:37,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:33:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 498 proven. 12 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-03 23:33:37,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:33:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 78 proven. 12 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 23:33:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218774696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:33:37,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:33:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-03 23:33:37,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370294448] [2025-03-03 23:33:37,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:33:37,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:33:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:33:37,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:33:37,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:33:37,921 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:33:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:33:38,211 INFO L93 Difference]: Finished difference Result 143 states and 214 transitions. [2025-03-03 23:33:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:33:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 186 [2025-03-03 23:33:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:33:38,213 INFO L225 Difference]: With dead ends: 143 [2025-03-03 23:33:38,213 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 23:33:38,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:33:38,214 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 176 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:33:38,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 139 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:33:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 23:33:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-03 23:33:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 107 transitions. [2025-03-03 23:33:38,232 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 107 transitions. Word has length 186 [2025-03-03 23:33:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:33:38,233 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 107 transitions. [2025-03-03 23:33:38,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:33:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 107 transitions. [2025-03-03 23:33:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:38,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:38,235 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,243 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:33:38,438 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,SelfDestructingSolverStorable1 [2025-03-03 23:33:38,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:38,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1618909661, now seen corresponding path program 1 times [2025-03-03 23:33:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:33:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384817318] [2025-03-03 23:33:38,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:33:38,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:38,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:38,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:38,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 23:33:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:33:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384817318] [2025-03-03 23:33:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384817318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:33:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:33:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:33:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148160969] [2025-03-03 23:33:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:33:38,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:33:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:33:38,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:33:38,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:33:38,948 INFO L87 Difference]: Start difference. First operand 74 states and 107 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:33:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:33:39,194 INFO L93 Difference]: Finished difference Result 188 states and 273 transitions. [2025-03-03 23:33:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:33:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 186 [2025-03-03 23:33:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:33:39,197 INFO L225 Difference]: With dead ends: 188 [2025-03-03 23:33:39,197 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 23:33:39,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:33:39,198 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 110 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:33:39,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 206 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:33:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 23:33:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-03-03 23:33:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:33:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-03 23:33:39,224 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 186 [2025-03-03 23:33:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:33:39,224 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-03 23:33:39,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 23:33:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-03 23:33:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:39,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:39,227 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:33:39,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1589356989, now seen corresponding path program 1 times [2025-03-03 23:33:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:33:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713783281] [2025-03-03 23:33:39,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:33:39,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:39,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:39,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:39,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:33:39,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152015446] [2025-03-03 23:33:39,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:39,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:33:39,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:33:39,346 INFO L229 MonitoredProcess]: Starting monitored process 4 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:33:39,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:33:39,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:39,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:39,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:39,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:33:39,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:33:39,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:39,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:39,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:39,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:33:39,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:33:39,575 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:33:39,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:33:39,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:33:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:33:39,780 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:33:39,884 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:33:39,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:33:39 BoogieIcfgContainer [2025-03-03 23:33:39,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:33:39,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:33:39,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:33:39,888 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:33:39,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:35" (3/4) ... [2025-03-03 23:33:39,891 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:33:39,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:33:39,892 INFO L158 Benchmark]: Toolchain (without parser) took 4690.63ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.7MB in the beginning and 222.4MB in the end (delta: -115.8MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-03-03 23:33:39,892 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:33:39,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.86ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:33:39,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.07ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:33:39,894 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:33:39,894 INFO L158 Benchmark]: IcfgBuilder took 368.64ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 66.5MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:33:39,894 INFO L158 Benchmark]: TraceAbstraction took 3996.85ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 66.5MB in the beginning and 222.5MB in the end (delta: -156.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2025-03-03 23:33:39,894 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 318.8MB. Free memory was 222.5MB in the beginning and 222.4MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:33:39,895 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.15ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.86ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.07ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 368.64ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 66.5MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3996.85ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 66.5MB in the beginning and 222.5MB in the end (delta: -156.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 318.8MB. Free memory was 222.5MB in the beginning and 222.4MB in the end (delta: 97.0kB). 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 someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.8; [L23] double var_1_6 = 127.5; [L24] double var_1_7 = 2.6; [L25] double var_1_8 = 4.5; [L26] signed short int var_1_9 = -128; [L27] signed short int var_1_10 = 16; [L28] signed short int var_1_11 = 4; [L29] signed short int var_1_12 = 100; [L30] signed short int var_1_13 = 64; [L31] signed short int var_1_14 = 2; [L32] signed long int var_1_15 = 5; [L33] signed char var_1_17 = -2; [L34] signed char var_1_18 = -4; [L35] signed char var_1_19 = 8; [L36] signed char var_1_20 = 10; [L37] unsigned long int var_1_21 = 25; [L38] unsigned long int var_1_22 = 3797799060; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_27 = -4; [L44] signed short int var_1_28 = 24644; [L45] signed char var_1_29 = 1; [L46] signed char var_1_30 = -1; [L47] unsigned char var_1_31 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_6=255/2, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L142] isInitial = 1 [L143] FCALL initially() [L144] int k_loop; [L145] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_6=255/2, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L145] COND TRUE k_loop < 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L86] var_1_6 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L87] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L88] var_1_7 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L89] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L90] var_1_8 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L91] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L92] var_1_10 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L93] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L94] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L94] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L95] var_1_11 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L96] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L97] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L97] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L98] var_1_12 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L99] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L100] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L100] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L103] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L103] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L106] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L106] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L107] var_1_18 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L108] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L109] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L109] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L110] var_1_19 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L111] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L112] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L112] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L113] var_1_20 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L114] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L115] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L115] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L116] var_1_22 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_22 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L117] RET assume_abort_if_not(var_1_22 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L118] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L118] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L119] var_1_24 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L120] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L121] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L121] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L123] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L124] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L124] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L125] var_1_26 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L126] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L127] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L127] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L128] var_1_28 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L129] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L130] CALL assume_abort_if_not(var_1_28 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L130] RET assume_abort_if_not(var_1_28 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L131] var_1_30 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L132] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L133] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L133] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=1, var_1_31=0, var_1_9=-128] [L147] RET updateVariables() [L148] CALL step() [L51] var_1_9 = (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14)))) [L52] var_1_17 = (var_1_18 + (var_1_19 - var_1_20)) [L53] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20) [L54] var_1_31 = var_1_26 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_9=0] [L55] COND FALSE !(var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) [L62] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L64] COND FALSE !(\read(var_1_31)) [L67] var_1_23 = (var_1_24 && (var_1_25 && var_1_26)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L69] COND FALSE !((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) [L76] var_1_27 = ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L78] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L81] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L138-L139] return (((((((((var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) ? ((var_1_29 > var_1_29) ? (var_1_1 == ((double) (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) + var_1_8))) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_7))) && (var_1_9 == ((signed short int) (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14))))))) && (var_1_23 ? (var_1_15 == ((signed long int) (var_1_14 - var_1_13))) : 1)) && (var_1_17 == ((signed char) (var_1_18 + (var_1_19 - var_1_20))))) && (var_1_23 ? (var_1_21 == ((unsigned long int) ((var_1_22 - (1000000000u - var_1_13)) - var_1_14))) : 1)) && (var_1_31 ? (var_1_23 == ((unsigned char) (var_1_24 && var_1_25))) : (var_1_23 == ((unsigned char) (var_1_24 && (var_1_25 && var_1_26)))))) && (((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) ? (var_1_31 ? (var_1_27 == ((signed short int) (var_1_19 - var_1_12))) : (var_1_27 == ((signed short int) (var_1_13 - (var_1_28 - (var_1_20 + var_1_19)))))) : (var_1_27 == ((signed short int) ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))))))) && (var_1_29 == ((signed char) (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20)))) && (var_1_31 == ((unsigned char) var_1_26)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-126, var_1_18=-63, var_1_19=0, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=-1073741826, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-62, var_1_28=16383, var_1_29=-62, var_1_30=1, var_1_31=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 333 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 561 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1302 NumberOfCodeBlocks, 1302 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 1418 SizeOfPredicates, 2 NumberOfNonLiveVariables, 844 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 11064/11160 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:33:39,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.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 de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:33:41,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:33:41,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:33:41,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:33:41,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:33:41,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:33:41,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:33:41,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:33:41,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:33:41,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:33:41,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:33:41,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:33:41,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:33:41,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:33:41,851 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:33:41,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:33:41,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:33:41,852 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:33:41,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:33:41,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:33:41,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:33:41,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:33:41,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:33:41,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:33:41,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:33:41,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:33:41,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:33:41,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:33:41,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:33:41,855 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 -> de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 [2025-03-03 23:33:42,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:33:42,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:33:42,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:33:42,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:33:42,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:33:42,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2025-03-03 23:33:43,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701830656/445ae6f9aab049ae915843f84320f6d3/FLAG23b3953c4 [2025-03-03 23:33:43,466 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:33:43,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2025-03-03 23:33:43,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701830656/445ae6f9aab049ae915843f84320f6d3/FLAG23b3953c4 [2025-03-03 23:33:43,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701830656/445ae6f9aab049ae915843f84320f6d3 [2025-03-03 23:33:43,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:33:43,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:33:43,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:33:43,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:33:43,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:33:43,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:43" (1/1) ... [2025-03-03 23:33:43,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61057c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:43, skipping insertion in model container [2025-03-03 23:33:43,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:43" (1/1) ... [2025-03-03 23:33:43,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:33:43,917 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-1loop_file-55.i[915,928] [2025-03-03 23:33:43,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:33:43,966 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:33:43,974 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-1loop_file-55.i[915,928] [2025-03-03 23:33:43,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:33:44,009 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:33:44,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44 WrapperNode [2025-03-03 23:33:44,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:33:44,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:33:44,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:33:44,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:33:44,015 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:33:44" (1/1) ... [2025-03-03 23:33:44,021 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:33:44" (1/1) ... [2025-03-03 23:33:44,049 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-03-03 23:33:44,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:33:44,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:33:44,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:33:44,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:33:44,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,073 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:33:44,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:33:44,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:33:44,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:33:44,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:33:44,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (1/1) ... [2025-03-03 23:33:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:33:44,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:33:44,130 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:33:44,133 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:33:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:33:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:33:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:33:44,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:33:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:33:44,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:33:44,225 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:33:44,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:33:44,587 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:33:44,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:33:44,597 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:33:44,598 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:33:44,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:44 BoogieIcfgContainer [2025-03-03 23:33:44,598 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:33:44,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:33:44,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:33:44,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:33:44,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:33:43" (1/3) ... [2025-03-03 23:33:44,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9a4d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:44, skipping insertion in model container [2025-03-03 23:33:44,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:44" (2/3) ... [2025-03-03 23:33:44,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9a4d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:44, skipping insertion in model container [2025-03-03 23:33:44,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:44" (3/3) ... [2025-03-03 23:33:44,606 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i [2025-03-03 23:33:44,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:33:44,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:33:44,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:33:44,673 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;@7773528b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:33:44,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:33:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:44,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:44,688 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:44,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1645415873, now seen corresponding path program 1 times [2025-03-03 23:33:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:33:44,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185394274] [2025-03-03 23:33:44,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:44,702 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:33:44,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:33:44,704 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:33:44,705 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:33:44,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:44,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:44,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:44,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:33:44,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:33:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2025-03-03 23:33:44,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:33:44,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:33:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185394274] [2025-03-03 23:33:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185394274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:33:44,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:33:44,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:33:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014876938] [2025-03-03 23:33:44,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:33:44,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:33:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:33:44,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:33:44,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:33:44,964 INFO L87 Difference]: Start difference. First operand has 73 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 23:33:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:33:44,982 INFO L93 Difference]: Finished difference Result 143 states and 252 transitions. [2025-03-03 23:33:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:33:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2025-03-03 23:33:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:33:44,987 INFO L225 Difference]: With dead ends: 143 [2025-03-03 23:33:44,987 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:33:44,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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:33:44,992 INFO L435 NwaCegarLoop]: 109 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, 109 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:33:44,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:33:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:33:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 23:33:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 23:33:45,021 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 186 [2025-03-03 23:33:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:33:45,021 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 23:33:45,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 23:33:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 23:33:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:45,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:45,026 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:45,032 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:33:45,228 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:33:45,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:45,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash 933247300, now seen corresponding path program 1 times [2025-03-03 23:33:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:33:45,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506542820] [2025-03-03 23:33:45,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:45,230 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:33:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:33:45,232 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:33:45,233 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:33:45,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:45,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:45,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:45,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:45,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:33:45,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:33:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 498 proven. 12 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-03 23:33:45,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:33:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 78 proven. 12 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 23:33:45,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:33:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506542820] [2025-03-03 23:33:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506542820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:33:45,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:33:45,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 23:33:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433330558] [2025-03-03 23:33:45,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:33:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:33:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:33:45,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:33:45,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:33:45,766 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:33:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:33:46,143 INFO L93 Difference]: Finished difference Result 143 states and 214 transitions. [2025-03-03 23:33:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:33:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 186 [2025-03-03 23:33:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:33:46,148 INFO L225 Difference]: With dead ends: 143 [2025-03-03 23:33:46,149 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 23:33:46,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:33:46,150 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 82 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:33:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 138 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:33:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 23:33:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-03 23:33:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 107 transitions. [2025-03-03 23:33:46,164 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 107 transitions. Word has length 186 [2025-03-03 23:33:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:33:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 107 transitions. [2025-03-03 23:33:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:33:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 107 transitions. [2025-03-03 23:33:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:46,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:46,168 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:46,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:33:46,368 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:33:46,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:46,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1618909661, now seen corresponding path program 1 times [2025-03-03 23:33:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:33:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737247925] [2025-03-03 23:33:46,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:46,369 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:33:46,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:33:46,373 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:33:46,374 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:33:46,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:46,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:46,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:46,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:46,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:33:46,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:33:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 498 proven. 12 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-03 23:33:46,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:33:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 78 proven. 12 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 23:33:46,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:33:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737247925] [2025-03-03 23:33:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737247925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:33:46,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:33:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 23:33:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279706761] [2025-03-03 23:33:46,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:33:46,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:33:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:33:46,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:33:46,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:33:46,801 INFO L87 Difference]: Start difference. First operand 74 states and 107 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:33:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:33:47,441 INFO L93 Difference]: Finished difference Result 210 states and 306 transitions. [2025-03-03 23:33:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:33:47,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 186 [2025-03-03 23:33:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:33:47,443 INFO L225 Difference]: With dead ends: 210 [2025-03-03 23:33:47,443 INFO L226 Difference]: Without dead ends: 139 [2025-03-03 23:33:47,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:33:47,444 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 99 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:33:47,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 281 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:33:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-03 23:33:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 74. [2025-03-03 23:33:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 23:33:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2025-03-03 23:33:47,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 186 [2025-03-03 23:33:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:33:47,458 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2025-03-03 23:33:47,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:33:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2025-03-03 23:33:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 23:33:47,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:33:47,460 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:47,465 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 (4)] Ended with exit code 0 [2025-03-03 23:33:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:33:47,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:33:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:33:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1589356989, now seen corresponding path program 1 times [2025-03-03 23:33:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:33:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790516506] [2025-03-03 23:33:47,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:33:47,661 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:33:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:33:47,663 INFO L229 MonitoredProcess]: Starting monitored process 5 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:33:47,665 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 (5)] Waiting until timeout for monitored process [2025-03-03 23:33:47,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 23:33:47,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 23:33:47,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:33:47,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:33:47,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 23:33:47,803 INFO L279 TraceCheckSpWp]: Computing forward predicates...