./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.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 cf1cc6bf3d59cf414502b0c19f16702b663394d6e2c4582d46166aaee995a12f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:59:42,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:59:42,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:59:42,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:59:42,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:59:42,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:59:42,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:59:42,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:59:42,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:59:42,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:59:42,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:59:42,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:59:42,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:59:42,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:59:42,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:59:42,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:59:42,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:59:42,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:59:42,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:59:42,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:59:42,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:59:42,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:59:42,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:59:42,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:59:42,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:59:42,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:59:42,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:59:42,551 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 -> cf1cc6bf3d59cf414502b0c19f16702b663394d6e2c4582d46166aaee995a12f [2025-03-08 09:59:42,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:59:42,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:59:42,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:59:42,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:59:42,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:59:42,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.i [2025-03-08 09:59:43,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a03d340/a4a0586d82e14615aa7777bb6c1f41dd/FLAG306a189d1 [2025-03-08 09:59:44,212 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:59:44,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.i [2025-03-08 09:59:44,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a03d340/a4a0586d82e14615aa7777bb6c1f41dd/FLAG306a189d1 [2025-03-08 09:59:44,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a03d340/a4a0586d82e14615aa7777bb6c1f41dd [2025-03-08 09:59:44,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:59:44,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:59:44,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:59:44,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:59:44,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:59:44,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44, skipping insertion in model container [2025-03-08 09:59:44,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:59:44,603 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_codestructure_normal_file-29.i[913,926] [2025-03-08 09:59:44,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:59:44,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:59:44,679 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_codestructure_normal_file-29.i[913,926] [2025-03-08 09:59:44,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:59:44,714 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:59:44,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44 WrapperNode [2025-03-08 09:59:44,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:59:44,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:59:44,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:59:44,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:59:44,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,756 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-03-08 09:59:44,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:59:44,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:59:44,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:59:44,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:59:44,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,784 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:59:44,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:59:44,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:59:44,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:59:44,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:59:44,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (1/1) ... [2025-03-08 09:59:44,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:59:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:59:44,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:59:44,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:59:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:59:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:59:44,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:59:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:59:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:59:44,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:59:44,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:59:44,909 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:59:45,194 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:59:45,194 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:59:45,205 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:59:45,205 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:59:45,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:45 BoogieIcfgContainer [2025-03-08 09:59:45,206 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:59:45,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:59:45,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:59:45,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:59:45,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:59:44" (1/3) ... [2025-03-08 09:59:45,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b3296b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:45, skipping insertion in model container [2025-03-08 09:59:45,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:44" (2/3) ... [2025-03-08 09:59:45,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b3296b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:45, skipping insertion in model container [2025-03-08 09:59:45,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:45" (3/3) ... [2025-03-08 09:59:45,215 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-29.i [2025-03-08 09:59:45,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:59:45,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-29.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:59:45,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:59:45,289 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;@2275fb46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:59:45,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:59:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 09:59:45,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:45,306 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:45,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:45,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 46897059, now seen corresponding path program 1 times [2025-03-08 09:59:45,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:59:45,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297887907] [2025-03-08 09:59:45,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:59:45,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:45,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 09:59:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:59:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297887907] [2025-03-08 09:59:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297887907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:59:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108159441] [2025-03-08 09:59:45,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:45,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:59:45,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:59:45,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:59:45,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:59:45,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:45,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:45,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:45,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:45,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:59:45,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:59:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 09:59:45,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:59:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108159441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:59:45,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:59:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:59:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971707233] [2025-03-08 09:59:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:59:45,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:59:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:59:45,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:59:45,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:59:45,786 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 09:59:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:59:45,804 INFO L93 Difference]: Finished difference Result 162 states and 290 transitions. [2025-03-08 09:59:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:59:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 211 [2025-03-08 09:59:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:59:45,810 INFO L225 Difference]: With dead ends: 162 [2025-03-08 09:59:45,810 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 09:59:45,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:59:45,813 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:59:45,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:59:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 09:59:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 09:59:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2025-03-08 09:59:45,843 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 211 [2025-03-08 09:59:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:59:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2025-03-08 09:59:45,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 09:59:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2025-03-08 09:59:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 09:59:45,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:45,847 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:45,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:59:46,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 09:59:46,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:46,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1981393250, now seen corresponding path program 1 times [2025-03-08 09:59:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:59:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-03-08 09:59:46,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:59:46,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:46,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:46,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 09:59:46,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:59:46,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-03-08 09:59:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146524335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:59:46,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:59:46,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:59:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942844572] [2025-03-08 09:59:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:59:46,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:59:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:59:46,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:59:46,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:59:46,291 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 09:59:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:59:46,324 INFO L93 Difference]: Finished difference Result 175 states and 270 transitions. [2025-03-08 09:59:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:59:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2025-03-08 09:59:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:59:46,330 INFO L225 Difference]: With dead ends: 175 [2025-03-08 09:59:46,331 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 09:59:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:59:46,333 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 26 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:59:46,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 252 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:59:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 09:59:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2025-03-08 09:59:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-03-08 09:59:46,343 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 211 [2025-03-08 09:59:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:59:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-03-08 09:59:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 09:59:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-03-08 09:59:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 09:59:46,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:46,360 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:46,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:59:46,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:46,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash -516622687, now seen corresponding path program 1 times [2025-03-08 09:59:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:59:46,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-03-08 09:59:46,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:59:46,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 90 proven. 12 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 09:59:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:59:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-03-08 09:59:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406960763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:59:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161705667] [2025-03-08 09:59:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:59:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:59:46,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:59:46,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:59:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:46,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:46,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:46,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:46,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 09:59:46,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:59:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1484 proven. 12 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2025-03-08 09:59:47,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:59:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 90 proven. 12 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 09:59:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161705667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:59:47,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:59:47,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-08 09:59:47,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-03-08 09:59:47,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:59:47,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:59:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:59:47,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:59:47,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:59:47,571 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (77), 6 states have call predecessors, (77), 6 states have call successors, (77) [2025-03-08 09:59:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:59:47,848 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2025-03-08 09:59:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:59:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (77), 6 states have call predecessors, (77), 6 states have call successors, (77) Word has length 211 [2025-03-08 09:59:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:59:47,852 INFO L225 Difference]: With dead ends: 169 [2025-03-08 09:59:47,852 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 09:59:47,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:59:47,853 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 71 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:59:47,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 216 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:59:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 09:59:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-08 09:59:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2025-03-08 09:59:47,867 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 211 [2025-03-08 09:59:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:59:47,867 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2025-03-08 09:59:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (77), 6 states have call predecessors, (77), 6 states have call successors, (77) [2025-03-08 09:59:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2025-03-08 09:59:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 09:59:47,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:47,870 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:47,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:59:48,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 09:59:48,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2110312932, now seen corresponding path program 1 times [2025-03-08 09:59:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:59:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302199102] [2025-03-08 09:59:48,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:59:48,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 09:59:48,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 09:59:48,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:48,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:59:48,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459685826] [2025-03-08 09:59:48,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:59:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:59:48,210 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-08 09:59:48,212 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-08 09:59:48,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 09:59:48,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 09:59:48,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:48,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:59:48,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:59:48,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 09:59:48,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 09:59:48,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:59:48,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:59:48,484 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:59:48,485 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:59:48,494 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-08 09:59:48,687 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-08 09:59:48,690 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 09:59:48,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:59:48,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:59:48 BoogieIcfgContainer [2025-03-08 09:59:48,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:59:48,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:59:48,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:59:48,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:59:48,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:45" (3/4) ... [2025-03-08 09:59:48,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:59:48,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:59:48,788 INFO L158 Benchmark]: Toolchain (without parser) took 4302.81ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.5MB in the beginning and 246.8MB in the end (delta: -142.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2025-03-08 09:59:48,788 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:59:48,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.53ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 90.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:59:48,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.07ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:59:48,789 INFO L158 Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 85.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:59:48,789 INFO L158 Benchmark]: IcfgBuilder took 410.05ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 64.9MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:59:48,789 INFO L158 Benchmark]: TraceAbstraction took 3575.80ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 64.9MB in the beginning and 246.9MB in the end (delta: -182.0MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2025-03-08 09:59:48,790 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 327.2MB. Free memory was 246.9MB in the beginning and 246.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:59:48,791 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.53ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 90.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.07ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.16ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 85.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 410.05ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 64.9MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3575.80ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 64.9MB in the beginning and 246.9MB in the end (delta: -182.0MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 327.2MB. Free memory was 246.9MB in the beginning and 246.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1; [L25] double var_1_4 = 99999.75; [L26] double var_1_5 = 31.75; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] signed short int var_1_8 = 0; [L30] signed short int var_1_9 = 0; [L31] signed short int var_1_10 = 8; [L32] signed char var_1_11 = 1; [L33] signed char var_1_12 = 32; [L34] signed char var_1_13 = -2; [L35] signed char var_1_14 = 8; [L36] signed char var_1_15 = 0; [L37] signed char var_1_16 = 10; [L38] signed char var_1_17 = 32; [L39] unsigned char var_1_18 = 0; [L40] signed char var_1_19 = -1; [L41] signed short int var_1_20 = 100; [L42] double var_1_21 = 9.25; [L43] signed short int var_1_22 = 29265; [L44] float var_1_23 = 31.6; [L45] float var_1_24 = 9.2; [L46] float var_1_25 = 15.6; [L47] float var_1_26 = 25.25; [L48] unsigned long int var_1_27 = 256; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=0, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L156] isInitial = 1 [L157] FCALL initially() [L158] COND TRUE 1 [L159] FCALL updateLastVariables() [L160] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=1, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L96] var_1_3 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_4=399999/4, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L99] var_1_4 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_5=127/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L101] var_1_5 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L103] var_1_6 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_7=0, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_7=0, var_1_8=0, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L106] var_1_7 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L109] var_1_9 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L110] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L111] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L111] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L112] var_1_10 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L113] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L114] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L114] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L115] var_1_12 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L116] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L117] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L117] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L118] var_1_13 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L119] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L120] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L120] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L121] var_1_14 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L122] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L123] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L123] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L124] var_1_15 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L125] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L126] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L126] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L127] var_1_16 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L128] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L129] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L129] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L130] var_1_17 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L131] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L132] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L132] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L133] var_1_19 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L134] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L135] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L135] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L136] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L136] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_21=37/4, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L137] var_1_21 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L138] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L139] var_1_22 = __VERIFIER_nondet_short() [L140] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L140] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L141] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L141] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L142] var_1_24 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L143] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L144] var_1_25 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L145] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L146] var_1_26 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L147] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L160] RET updateVariables() [L161] CALL step() [L52] COND TRUE \read(var_1_2) [L53] var_1_1 = (((-128 <= var_1_3) || (var_1_4 >= var_1_5)) && var_1_6) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L57] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L58] COND TRUE \read(var_1_2) [L59] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L71] COND FALSE !(var_1_4 == var_1_5) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L76] COND TRUE (- ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (1.625 * var_1_21) [L77] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L81] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L82] COND TRUE var_1_10 <= var_1_17 [L83] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_27=256, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L88] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L89] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_27=0, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L161] RET step() [L162] CALL, EXPR property() [L152-L153] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_3) || (var_1_4 >= var_1_5)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_2 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_3 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_4 == var_1_5) ? ((var_1_15 >= (var_1_11 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (1.625 * var_1_21)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_27=0, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L162] RET, EXPR property() [L162] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_27=0, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] [L19] reach_error() VAL [isInitial=1, var_1_10=126, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=126, var_1_18=0, var_1_19=2, var_1_1=0, var_1_20=16256, var_1_22=16382, var_1_27=0, var_1_2=1, var_1_3=-2147483648, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 165 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 346 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1260 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873 SizeOfPredicates, 3 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 14176/14280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:59:48,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.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 cf1cc6bf3d59cf414502b0c19f16702b663394d6e2c4582d46166aaee995a12f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:59:50,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:59:50,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:59:50,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:59:50,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:59:50,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:59:50,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:59:50,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:59:50,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:59:50,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:59:50,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:59:50,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:59:50,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:59:50,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:59:50,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:59:50,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:59:50,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:59:50,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:59:50,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:59:50,727 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 -> cf1cc6bf3d59cf414502b0c19f16702b663394d6e2c4582d46166aaee995a12f [2025-03-08 09:59:50,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:59:50,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:59:50,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:59:50,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:59:50,977 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:59:50,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.i [2025-03-08 09:59:52,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235524568/70f29c8ebdc444d48334d617c591d411/FLAG6ac4284e1 [2025-03-08 09:59:52,389 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:59:52,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-29.i [2025-03-08 09:59:52,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235524568/70f29c8ebdc444d48334d617c591d411/FLAG6ac4284e1 [2025-03-08 09:59:52,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235524568/70f29c8ebdc444d48334d617c591d411 [2025-03-08 09:59:52,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:59:52,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:59:52,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:59:52,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:59:52,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:59:52,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61698d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52, skipping insertion in model container [2025-03-08 09:59:52,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:59:52,556 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_codestructure_normal_file-29.i[913,926] [2025-03-08 09:59:52,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:59:52,634 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:59:52,645 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_codestructure_normal_file-29.i[913,926] [2025-03-08 09:59:52,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:59:52,700 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:59:52,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52 WrapperNode [2025-03-08 09:59:52,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:59:52,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:59:52,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:59:52,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:59:52,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,750 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-08 09:59:52,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:59:52,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:59:52,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:59:52,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:59:52,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:59:52,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:59:52,798 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:59:52,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:59:52,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:59:52,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (1/1) ... [2025-03-08 09:59:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:59:52,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:59:52,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:59:52,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:59:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:59:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:59:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:59:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:59:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:59:52,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:59:52,924 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:59:52,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:59:54,525 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:59:54,525 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:59:54,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:59:54,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:59:54,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:54 BoogieIcfgContainer [2025-03-08 09:59:54,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:59:54,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:59:54,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:59:54,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:59:54,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:59:52" (1/3) ... [2025-03-08 09:59:54,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615729b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:54, skipping insertion in model container [2025-03-08 09:59:54,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:52" (2/3) ... [2025-03-08 09:59:54,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615729b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:54, skipping insertion in model container [2025-03-08 09:59:54,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:54" (3/3) ... [2025-03-08 09:59:54,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-29.i [2025-03-08 09:59:54,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:59:54,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-29.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:59:54,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:59:54,594 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;@609757c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:59:54,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:59:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 09:59:54,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:54,609 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:54,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash 46897059, now seen corresponding path program 1 times [2025-03-08 09:59:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:59:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300920976] [2025-03-08 09:59:54,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:54,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:59:54,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:59:54,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:59:54,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 09:59:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:54,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:54,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:54,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:54,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:59:54,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:59:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2025-03-08 09:59:54,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:59:54,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:59:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300920976] [2025-03-08 09:59:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300920976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:59:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:59:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:59:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350396920] [2025-03-08 09:59:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:59:54,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:59:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:59:54,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:59:54,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:59:55,000 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 09:59:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:59:55,027 INFO L93 Difference]: Finished difference Result 162 states and 290 transitions. [2025-03-08 09:59:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:59:55,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 211 [2025-03-08 09:59:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:59:55,033 INFO L225 Difference]: With dead ends: 162 [2025-03-08 09:59:55,033 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 09:59:55,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:59:55,037 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:59:55,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:59:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 09:59:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 09:59:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2025-03-08 09:59:55,066 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 211 [2025-03-08 09:59:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:59:55,066 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2025-03-08 09:59:55,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 09:59:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2025-03-08 09:59:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 09:59:55,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:55,069 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:55,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 09:59:55,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:59:55,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:55,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1981393250, now seen corresponding path program 1 times [2025-03-08 09:59:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:59:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129121033] [2025-03-08 09:59:55,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:55,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:59:55,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:59:55,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:59:55,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 09:59:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:55,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:55,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 09:59:55,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:59:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 09:59:55,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:59:55,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:59:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129121033] [2025-03-08 09:59:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129121033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:59:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:59:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:59:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282398969] [2025-03-08 09:59:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:59:55,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:59:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:59:55,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:59:55,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:59:55,637 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 09:59:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:59:56,200 INFO L93 Difference]: Finished difference Result 175 states and 270 transitions. [2025-03-08 09:59:56,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:59:56,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2025-03-08 09:59:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:59:56,217 INFO L225 Difference]: With dead ends: 175 [2025-03-08 09:59:56,217 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 09:59:56,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:59:56,219 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:59:56,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:59:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 09:59:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2025-03-08 09:59:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-03-08 09:59:56,228 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 211 [2025-03-08 09:59:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:59:56,230 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-03-08 09:59:56,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 09:59:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-03-08 09:59:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 09:59:56,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:56,232 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:56,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:59:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:59:56,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -516622687, now seen corresponding path program 1 times [2025-03-08 09:59:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:59:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763620248] [2025-03-08 09:59:56,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:56,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:59:56,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:59:56,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:59:56,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 09:59:56,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:56,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:56,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:56,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:56,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 09:59:56,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:59:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 574 proven. 12 refuted. 0 times theorem prover too weak. 1794 trivial. 0 not checked. [2025-03-08 09:59:56,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:59:56,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:59:56,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763620248] [2025-03-08 09:59:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763620248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:59:56,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1740837612] [2025-03-08 09:59:56,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:56,914 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 09:59:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 09:59:56,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 09:59:56,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 09:59:56,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 09:59:57,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 09:59:57,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:57,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:57,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 09:59:57,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:59:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 574 proven. 12 refuted. 0 times theorem prover too weak. 1794 trivial. 0 not checked. [2025-03-08 09:59:57,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:59:57,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1740837612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:59:57,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:59:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-08 09:59:57,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830667101] [2025-03-08 09:59:57,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:59:57,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:59:57,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:59:57,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:59:57,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:59:57,932 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 09:59:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:59:59,199 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2025-03-08 09:59:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:59:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 211 [2025-03-08 09:59:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:59:59,213 INFO L225 Difference]: With dead ends: 169 [2025-03-08 09:59:59,213 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 09:59:59,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:59:59,214 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 71 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:59:59,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 177 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 09:59:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 09:59:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-08 09:59:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 09:59:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2025-03-08 09:59:59,223 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 211 [2025-03-08 09:59:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:59:59,227 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2025-03-08 09:59:59,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 09:59:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2025-03-08 09:59:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 09:59:59,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:59:59,229 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:59:59,239 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 (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:59:59,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 09:59:59,629 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 09:59:59,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:59:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:59:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2110312932, now seen corresponding path program 1 times [2025-03-08 09:59:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:59:59,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420347946] [2025-03-08 09:59:59,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:59:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:59:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:59:59,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:59:59,635 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 (6)] Waiting until timeout for monitored process [2025-03-08 09:59:59,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 09:59:59,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 09:59:59,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:59:59,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:59:59,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 09:59:59,997 INFO L279 TraceCheckSpWp]: Computing forward predicates...