./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.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 73080b6aad183930e4117faa4a34d2c3ffac40f8ac7f54624070c85760d249c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:10:39,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:10:39,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:10:39,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:10:39,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:10:39,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:10:39,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:10:39,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:10:39,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:10:39,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:10:39,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:10:39,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:10:39,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:10:39,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:10:39,650 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:10:39,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:10:39,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:10:39,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:10:39,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:10:39,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:10:39,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:10:39,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:39,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:10:39,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:10:39,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:10:39,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:10:39,653 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 -> 73080b6aad183930e4117faa4a34d2c3ffac40f8ac7f54624070c85760d249c9 [2025-03-17 03:10:39,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:10:39,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:10:39,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:10:39,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:10:39,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:10:39,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i [2025-03-17 03:10:41,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a198bc7f3/8d09fb57acad4601bef562aa30708f6e/FLAG11c008d15 [2025-03-17 03:10:41,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:10:41,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i [2025-03-17 03:10:41,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a198bc7f3/8d09fb57acad4601bef562aa30708f6e/FLAG11c008d15 [2025-03-17 03:10:41,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a198bc7f3/8d09fb57acad4601bef562aa30708f6e [2025-03-17 03:10:41,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:10:41,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:10:41,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:41,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:10:41,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:10:41,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41, skipping insertion in model container [2025-03-17 03:10:41,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:10:41,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i[916,929] [2025-03-17 03:10:41,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:41,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:10:41,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i[916,929] [2025-03-17 03:10:41,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:41,574 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:10:41,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41 WrapperNode [2025-03-17 03:10:41,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:41,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:41,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:10:41,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:10:41,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,632 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-17 03:10:41,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:41,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:10:41,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:10:41,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:10:41,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,674 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-17 03:10:41,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:10:41,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:10:41,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:10:41,702 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:10:41,703 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (1/1) ... [2025-03-17 03:10:41,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:41,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:41,729 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-17 03:10:41,732 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-17 03:10:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:10:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:10:41,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:10:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:10:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:10:41,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:10:41,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:10:41,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:10:42,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1; [2025-03-17 03:10:42,246 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-17 03:10:42,249 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:10:42,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:10:42,261 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 03:10:42,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:42 BoogieIcfgContainer [2025-03-17 03:10:42,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:10:42,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:10:42,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:10:42,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:10:42,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:10:41" (1/3) ... [2025-03-17 03:10:42,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae4bf9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:42, skipping insertion in model container [2025-03-17 03:10:42,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:41" (2/3) ... [2025-03-17 03:10:42,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae4bf9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:42, skipping insertion in model container [2025-03-17 03:10:42,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:42" (3/3) ... [2025-03-17 03:10:42,270 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-85.i [2025-03-17 03:10:42,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:10:42,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-85.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:10:42,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:10:42,334 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;@759a7357, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:10:42,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:10:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:10:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 03:10:42,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:42,349 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:42,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 592934648, now seen corresponding path program 1 times [2025-03-17 03:10:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:42,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698001769] [2025-03-17 03:10:42,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:42,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:42,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:10:42,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:10:42,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-17 03:10:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:42,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698001769] [2025-03-17 03:10:42,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698001769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:10:42,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233041100] [2025-03-17 03:10:42,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:10:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:42,694 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-17 03:10:42,695 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-17 03:10:42,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:10:42,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:10:42,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:42,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:42,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:10:42,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:10:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-17 03:10:42,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:10:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233041100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:42,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:10:42,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:10:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969403983] [2025-03-17 03:10:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:42,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:10:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:42,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:10:42,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:42,960 INFO L87 Difference]: Start difference. First operand has 98 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 03:10:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:42,983 INFO L93 Difference]: Finished difference Result 192 states and 337 transitions. [2025-03-17 03:10:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:10:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2025-03-17 03:10:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:42,989 INFO L225 Difference]: With dead ends: 192 [2025-03-17 03:10:42,990 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 03:10:42,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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-17 03:10:42,994 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:42,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:10:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 03:10:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 03:10:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:10:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2025-03-17 03:10:43,024 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 201 [2025-03-17 03:10:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2025-03-17 03:10:43,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 03:10:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2025-03-17 03:10:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 03:10:43,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:43,028 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:43,035 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-17 03:10:43,228 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-17 03:10:43,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:43,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash 300728960, now seen corresponding path program 1 times [2025-03-17 03:10:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856270432] [2025-03-17 03:10:43,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:43,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:10:43,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:10:43,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 03:10:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856270432] [2025-03-17 03:10:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856270432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:43,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:43,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:10:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180058702] [2025-03-17 03:10:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:43,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:10:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:43,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:10:43,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:10:43,475 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:43,561 INFO L93 Difference]: Finished difference Result 272 states and 426 transitions. [2025-03-17 03:10:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:10:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2025-03-17 03:10:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:43,565 INFO L225 Difference]: With dead ends: 272 [2025-03-17 03:10:43,565 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 03:10:43,566 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-17 03:10:43,567 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 128 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:43,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 272 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:10:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 03:10:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 103. [2025-03-17 03:10:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:10:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 161 transitions. [2025-03-17 03:10:43,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 161 transitions. Word has length 201 [2025-03-17 03:10:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:43,585 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 161 transitions. [2025-03-17 03:10:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 161 transitions. [2025-03-17 03:10:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 03:10:43,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:43,587 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:43,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:10:43,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:43,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash -719036212, now seen corresponding path program 1 times [2025-03-17 03:10:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835255826] [2025-03-17 03:10:43,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:43,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 03:10:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 03:10:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 03:10:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835255826] [2025-03-17 03:10:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835255826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:44,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:10:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696666071] [2025-03-17 03:10:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:10:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:44,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:10:44,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:10:44,054 INFO L87 Difference]: Start difference. First operand 103 states and 161 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:44,347 INFO L93 Difference]: Finished difference Result 427 states and 663 transitions. [2025-03-17 03:10:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:10:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2025-03-17 03:10:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:44,351 INFO L225 Difference]: With dead ends: 427 [2025-03-17 03:10:44,352 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 03:10:44,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:10:44,354 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 280 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:44,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 689 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:10:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 03:10:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 205. [2025-03-17 03:10:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-17 03:10:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 322 transitions. [2025-03-17 03:10:44,388 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 322 transitions. Word has length 202 [2025-03-17 03:10:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:44,389 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 322 transitions. [2025-03-17 03:10:44,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 322 transitions. [2025-03-17 03:10:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:10:44,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:44,394 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:10:44,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1532070121, now seen corresponding path program 1 times [2025-03-17 03:10:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352736490] [2025-03-17 03:10:44,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:44,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:10:44,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:10:44,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 03:10:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352736490] [2025-03-17 03:10:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352736490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:10:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146004005] [2025-03-17 03:10:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:44,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:10:44,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:44,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:10:44,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:10:44,670 INFO L87 Difference]: Start difference. First operand 205 states and 322 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:44,815 INFO L93 Difference]: Finished difference Result 627 states and 976 transitions. [2025-03-17 03:10:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:10:44,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-17 03:10:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:44,818 INFO L225 Difference]: With dead ends: 627 [2025-03-17 03:10:44,818 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 03:10:44,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:10:44,821 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 138 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:44,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 419 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:10:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 03:10:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 399. [2025-03-17 03:10:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 266 states have (on average 1.3796992481203008) internal successors, (367), 266 states have internal predecessors, (367), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 03:10:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 623 transitions. [2025-03-17 03:10:44,885 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 623 transitions. Word has length 203 [2025-03-17 03:10:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:44,885 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 623 transitions. [2025-03-17 03:10:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 623 transitions. [2025-03-17 03:10:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:10:44,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:44,887 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:44,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:10:44,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:44,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -953757683, now seen corresponding path program 1 times [2025-03-17 03:10:44,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:44,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434775031] [2025-03-17 03:10:44,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:44,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:44,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:10:44,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:10:44,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:44,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 03:10:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434775031] [2025-03-17 03:10:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434775031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:10:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675913973] [2025-03-17 03:10:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:45,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:10:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:45,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:10:45,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:10:45,264 INFO L87 Difference]: Start difference. First operand 399 states and 623 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:45,400 INFO L93 Difference]: Finished difference Result 1066 states and 1651 transitions. [2025-03-17 03:10:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:10:45,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-17 03:10:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:45,405 INFO L225 Difference]: With dead ends: 1066 [2025-03-17 03:10:45,406 INFO L226 Difference]: Without dead ends: 668 [2025-03-17 03:10:45,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:10:45,409 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 132 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:45,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 482 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:10:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-17 03:10:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 597. [2025-03-17 03:10:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 412 states have (on average 1.3713592233009708) internal successors, (565), 416 states have internal predecessors, (565), 176 states have call successors, (176), 8 states have call predecessors, (176), 8 states have return successors, (176), 172 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-17 03:10:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 917 transitions. [2025-03-17 03:10:45,477 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 917 transitions. Word has length 203 [2025-03-17 03:10:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:45,478 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 917 transitions. [2025-03-17 03:10:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:10:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 917 transitions. [2025-03-17 03:10:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:10:45,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:45,480 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:45,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:10:45,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:45,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1950830036, now seen corresponding path program 1 times [2025-03-17 03:10:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509311579] [2025-03-17 03:10:45,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:45,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:10:45,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:10:45,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:45,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 15 proven. 78 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 03:10:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509311579] [2025-03-17 03:10:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509311579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:10:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076670507] [2025-03-17 03:10:46,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:46,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:10:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:46,299 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-17 03:10:46,301 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-17 03:10:46,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:10:46,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:10:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:46,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:10:46,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:10:52,784 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (let ((.cse0 (mod v_z_2 ~var_1_5~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse0) (<= 0 v_z_2) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (= .cse0 (div ~var_1_25~0 ~var_1_3~0)) (= (mod ~var_1_25~0 ~var_1_3~0) 0))) (<= (+ ~var_1_3~0 1) 0))) (<= v_z_2 255)))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_5 Int)) (let ((.cse1 (mod v_z_5 ~var_1_5~0))) (and (exists ((~var_1_25~0 Int) (~var_1_3~0 Int)) (and (<= (+ ~var_1_25~0 1) 0) (<= 0 ~var_1_3~0) (<= (+ (div ~var_1_25~0 ~var_1_3~0) 1) .cse1) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= 0 v_z_5) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse1) (<= v_z_5 255)))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_4 Int)) (and (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse2 (div ~var_1_25~0 ~var_1_3~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse2) (<= (+ (mod v_z_4 ~var_1_5~0) 2) .cse2) (<= 0 ~var_1_25~0)))) (<= 0 ~var_1_3~0))) (<= 0 v_z_4) (<= v_z_4 255))))) (exists ((~var_1_5~0 Int)) (and (exists ((v_z_5 Int)) (let ((.cse3 (mod v_z_5 ~var_1_5~0))) (and (exists ((~var_1_3~0 Int)) (and (<= 0 ~var_1_3~0) (exists ((~var_1_25~0 Int)) (and (<= (+ (div ~var_1_25~0 ~var_1_3~0) 1) .cse3) (<= 0 ~var_1_25~0))))) (<= 0 v_z_5) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse3) (<= v_z_5 255)))) (not (= ~var_1_5~0 0)))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_5 Int)) (let ((.cse4 (mod v_z_5 ~var_1_5~0))) (and (<= 0 v_z_5) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (<= (+ (div ~var_1_25~0 ~var_1_3~0) 1) .cse4) (<= 0 ~var_1_25~0))) (<= (+ ~var_1_3~0 1) 0))) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse4) (<= v_z_5 255)))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_4 Int)) (and (<= 0 v_z_4) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse5 (div ~var_1_25~0 ~var_1_3~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse5) (<= (+ (mod v_z_4 ~var_1_5~0) 2) .cse5) (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= 0 ~var_1_3~0))) (<= v_z_4 255))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_5 Int)) (let ((.cse6 (mod v_z_5 ~var_1_5~0))) (and (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (<= (+ (div ~var_1_25~0 ~var_1_3~0) 1) .cse6) (= (mod ~var_1_25~0 ~var_1_3~0) 0))) (<= 0 ~var_1_3~0))) (<= 0 v_z_5) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse6) (<= v_z_5 255)))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (and (<= 0 v_z_2) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse7 (div ~var_1_25~0 ~var_1_3~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse7) (= (+ (mod v_z_2 ~var_1_5~0) 1) .cse7) (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= 0 ~var_1_3~0))) (<= v_z_2 255))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (let ((.cse8 (mod v_z_2 ~var_1_5~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8) (<= 0 v_z_2) (<= v_z_2 255) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (= .cse8 (div ~var_1_25~0 ~var_1_3~0)) (= (mod ~var_1_25~0 ~var_1_3~0) 0))) (<= 0 ~var_1_3~0)))))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (and (<= 0 v_z_2) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse9 (div ~var_1_25~0 ~var_1_3~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse9) (= (+ (mod v_z_2 ~var_1_5~0) 1) .cse9) (<= 0 ~var_1_25~0)))) (<= 0 ~var_1_3~0))) (<= v_z_2 255))))) (exists ((~var_1_5~0 Int)) (and (exists ((v_z_2 Int)) (let ((.cse10 (mod v_z_2 ~var_1_5~0))) (and (exists ((~var_1_25~0 Int) (~var_1_3~0 Int)) (and (= (+ .cse10 1) (div ~var_1_25~0 ~var_1_3~0)) (<= (+ ~var_1_3~0 1) 0) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse10) (<= 0 v_z_2) (<= v_z_2 255)))) (not (= ~var_1_5~0 0)))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_4 Int)) (and (<= 0 v_z_4) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse11 (div ~var_1_25~0 ~var_1_3~0))) (and (<= (+ ~var_1_25~0 1) 0) (<= (+ (mod v_z_4 ~var_1_5~0) 2) .cse11) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse11 1)) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0))))) (<= 0 ~var_1_3~0))) (<= v_z_4 255))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (let ((.cse12 (mod v_z_2 ~var_1_5~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse12) (<= 0 v_z_2) (exists ((~var_1_25~0 Int) (~var_1_3~0 Int)) (and (<= (+ ~var_1_25~0 1) 0) (= .cse12 (div ~var_1_25~0 ~var_1_3~0)) (<= (+ ~var_1_3~0 1) 0) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= v_z_2 255)))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_5 Int)) (let ((.cse13 (mod v_z_5 ~var_1_5~0))) (and (<= 0 v_z_5) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse13) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (<= (+ (div ~var_1_25~0 ~var_1_3~0) 1) .cse13) (= (mod ~var_1_25~0 ~var_1_3~0) 0))) (<= (+ ~var_1_3~0 1) 0))) (<= v_z_5 255)))))) (exists ((~var_1_5~0 Int)) (and (exists ((v_z_4 Int)) (and (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse14 (div ~var_1_25~0 ~var_1_3~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse14) (<= (+ (mod v_z_4 ~var_1_5~0) 2) .cse14) (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= (+ ~var_1_3~0 1) 0))) (<= 0 v_z_4) (<= v_z_4 255))) (not (= ~var_1_5~0 0)))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (let ((.cse15 (mod v_z_2 ~var_1_5~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse15) (<= 0 v_z_2) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (= .cse15 (div ~var_1_25~0 ~var_1_3~0)) (<= 0 ~var_1_25~0))) (<= (+ ~var_1_3~0 1) 0))) (<= v_z_2 255)))))) (exists ((~var_1_5~0 Int)) (and (exists ((v_z_2 Int)) (let ((.cse16 (mod v_z_2 ~var_1_5~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse16) (<= 0 v_z_2) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (and (= .cse16 (div ~var_1_25~0 ~var_1_3~0)) (<= 0 ~var_1_25~0))) (<= 0 ~var_1_3~0))) (<= v_z_2 255)))) (not (= ~var_1_5~0 0)))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (and (<= 0 v_z_2) (<= v_z_2 255) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse17 (div ~var_1_25~0 ~var_1_3~0))) (and (<= (+ ~var_1_25~0 1) 0) (= (+ (mod v_z_2 ~var_1_5~0) 1) .cse17) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse17 1)) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0))))) (<= 0 ~var_1_3~0))))))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_2 Int)) (and (<= 0 v_z_2) (<= v_z_2 255) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse18 (div ~var_1_25~0 ~var_1_3~0))) (and (<= (+ ~var_1_25~0 1) 0) (= (mod v_z_2 ~var_1_5~0) .cse18) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse18 1)) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0))))) (<= 0 ~var_1_3~0))))))) (exists ((~var_1_5~0 Int)) (and (exists ((v_z_2 Int)) (and (<= 0 v_z_2) (exists ((~var_1_3~0 Int)) (and (exists ((~var_1_25~0 Int)) (let ((.cse19 (div ~var_1_25~0 ~var_1_3~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse19) (= (+ (mod v_z_2 ~var_1_5~0) 1) .cse19) (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= (+ ~var_1_3~0 1) 0))) (<= v_z_2 255))) (not (= ~var_1_5~0 0)))) (exists ((~var_1_5~0 Int)) (and (not (= ~var_1_5~0 0)) (exists ((v_z_5 Int)) (let ((.cse20 (mod v_z_5 ~var_1_5~0))) (and (exists ((~var_1_25~0 Int) (~var_1_3~0 Int)) (and (<= (+ ~var_1_25~0 1) 0) (<= (+ ~var_1_3~0 1) 0) (<= (+ (div ~var_1_25~0 ~var_1_3~0) 1) .cse20) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0)))) (<= 0 v_z_5) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse20) (<= v_z_5 255)))))) (exists ((~var_1_5~0 Int)) (and (exists ((v_z_4 Int)) (and (<= 0 v_z_4) (exists ((~var_1_3~0 Int)) (and (<= (+ ~var_1_3~0 1) 0) (exists ((~var_1_25~0 Int)) (let ((.cse21 (div ~var_1_25~0 ~var_1_3~0))) (and (<= (+ (mod v_z_4 ~var_1_5~0) 2) .cse21) (= .cse21 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1)) (not (= (mod ~var_1_25~0 ~var_1_3~0) 0))))))) (<= v_z_4 255))) (not (= ~var_1_5~0 0))))) is different from true [2025-03-17 03:10:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 561 proven. 78 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2025-03-17 03:10:53,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:10:54,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076670507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:10:54,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:10:54,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2025-03-17 03:10:54,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118854158] [2025-03-17 03:10:54,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:10:54,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:10:54,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:54,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:10:54,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2025-03-17 03:10:54,393 INFO L87 Difference]: Start difference. First operand 597 states and 917 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-17 03:11:04,864 WARN L286 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 234 DAG size of output: 533 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 03:11:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:04,993 INFO L93 Difference]: Finished difference Result 1241 states and 1873 transitions. [2025-03-17 03:11:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:11:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 203 [2025-03-17 03:11:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:04,999 INFO L225 Difference]: With dead ends: 1241 [2025-03-17 03:11:04,999 INFO L226 Difference]: Without dead ends: 645 [2025-03-17 03:11:05,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2025-03-17 03:11:05,002 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 51 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:05,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 294 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2025-03-17 03:11:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-17 03:11:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 629. [2025-03-17 03:11:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 436 states have (on average 1.3188073394495412) internal successors, (575), 440 states have internal predecessors, (575), 176 states have call successors, (176), 16 states have call predecessors, (176), 16 states have return successors, (176), 172 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-17 03:11:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 927 transitions. [2025-03-17 03:11:05,056 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 927 transitions. Word has length 203 [2025-03-17 03:11:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:05,057 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 927 transitions. [2025-03-17 03:11:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (58), 2 states have call predecessors, (58), 3 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-17 03:11:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 927 transitions. [2025-03-17 03:11:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:11:05,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:05,060 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:11:05,068 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-17 03:11:05,261 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,SelfDestructingSolverStorable5 [2025-03-17 03:11:05,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:05,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -153878677, now seen corresponding path program 1 times [2025-03-17 03:11:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106902910] [2025-03-17 03:11:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:05,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:11:05,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:11:05,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:05,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:11:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878402674] [2025-03-17 03:11:05,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:11:05,394 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-17 03:11:05,396 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-17 03:11:05,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:11:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:11:05,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:05,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:11:05,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:11:05,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:11:05,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:11:05,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:05,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:11:05,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:11:05,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:11:05,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:11:05,684 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-17 03:11:05,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:05,879 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:05,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:11:05,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:11:05 BoogieIcfgContainer [2025-03-17 03:11:05,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:11:05,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:11:05,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:11:05,987 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:11:05,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:42" (3/4) ... [2025-03-17 03:11:05,989 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:11:05,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:11:05,990 INFO L158 Benchmark]: Toolchain (without parser) took 24662.67ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 132.6MB in the beginning and 147.3MB in the end (delta: -14.8MB). Peak memory consumption was 198.8MB. Max. memory is 16.1GB. [2025-03-17 03:11:05,990 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:11:05,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.02ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 115.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:11:05,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.60ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 110.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:11:05,991 INFO L158 Benchmark]: Boogie Preprocessor took 65.60ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 103.3MB in the end (delta: 7.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:11:05,991 INFO L158 Benchmark]: IcfgBuilder took 560.84ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 71.6MB in the end (delta: 31.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:11:05,992 INFO L158 Benchmark]: TraceAbstraction took 23722.32ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 71.0MB in the beginning and 147.4MB in the end (delta: -76.4MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2025-03-17 03:11:05,992 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 377.5MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 78.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:11:05,994 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 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.02ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 115.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.60ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 110.7MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.60ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 103.3MB in the end (delta: 7.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 560.84ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 71.6MB in the end (delta: 31.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23722.32ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 71.0MB in the beginning and 147.4MB in the end (delta: -76.4MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 377.5MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 78.1kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 207, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 207, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 207. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L23] signed char var_1_3 = -128; [L24] signed char var_1_5 = 16; [L25] unsigned char var_1_7 = 64; [L26] unsigned char var_1_8 = 200; [L27] unsigned char var_1_9 = 25; [L28] unsigned char var_1_10 = 32; [L29] unsigned char var_1_12 = 1; [L30] unsigned char var_1_13 = 1; [L31] double var_1_14 = 64.4; [L32] double var_1_15 = 0.0; [L33] double var_1_16 = 16.6; [L34] double var_1_17 = 3.25; [L35] double var_1_18 = 31.2; [L36] double var_1_19 = 1.9; [L37] double var_1_20 = 8.4; [L38] unsigned long int var_1_21 = 8; [L39] unsigned long int var_1_22 = 1709501341; [L40] unsigned char var_1_23 = 16; [L41] signed long int var_1_25 = -5; [L42] unsigned char var_1_26 = 1; [L43] signed short int var_1_27 = -5; [L44] float var_1_28 = 9.25; [L45] signed char var_1_29 = 32; [L46] signed char var_1_30 = -8; [L47] signed char var_1_31 = 5; [L48] signed char var_1_32 = 4; [L49] signed char var_1_33 = -25; [L50] unsigned char var_1_34 = 0; [L51] unsigned char var_1_35 = 0; [L52] double var_1_36 = 256.2; [L53] unsigned long int var_1_37 = 128; [L54] unsigned char last_1_var_1_12 = 1; [L55] unsigned char last_1_var_1_26 = 1; [L56] signed char last_1_var_1_29 = 32; [L211] isInitial = 1 [L212] FCALL initially() [L213] int k_loop; [L214] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=-128, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L214] COND TRUE k_loop < 1 [L215] CALL updateLastVariables() [L202] last_1_var_1_12 = var_1_12 [L203] last_1_var_1_26 = var_1_26 [L204] last_1_var_1_29 = var_1_29 [L215] RET updateLastVariables() [L216] CALL updateVariables() [L150] var_1_3 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L151] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L152] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L152] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L153] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L153] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=16, var_1_7=64, var_1_8=200, var_1_9=25] [L154] var_1_5 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_5 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L155] RET assume_abort_if_not(var_1_5 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L156] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L156] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L157] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L157] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=200, var_1_9=25] [L158] var_1_8 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=25] [L159] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=25] [L160] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=25] [L160] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=25] [L161] var_1_9 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66] [L162] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66] [L163] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L163] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L164] var_1_10 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L165] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L166] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L166] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=1, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L167] var_1_13 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L168] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L169] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L169] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_15=0, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L170] var_1_15 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L171] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_16=83/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L172] var_1_16 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L173] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_17=13/4, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L174] var_1_17 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L175] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_18=156/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L176] var_1_18 = __VERIFIER_nondet_double() [L177] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L177] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_19=19/10, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L178] var_1_19 = __VERIFIER_nondet_double() [L179] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L179] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_20=42/5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L180] var_1_20 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L181] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=1709501341, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L182] var_1_22 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_22 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L183] RET assume_abort_if_not(var_1_22 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L184] CALL assume_abort_if_not(var_1_22 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L184] RET assume_abort_if_not(var_1_22 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-8, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L185] var_1_30 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_30 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L186] RET assume_abort_if_not(var_1_30 >= -31) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L187] CALL assume_abort_if_not(var_1_30 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L187] RET assume_abort_if_not(var_1_30 <= 32) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=5, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L188] var_1_31 = __VERIFIER_nondet_char() [L189] CALL assume_abort_if_not(var_1_31 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L189] RET assume_abort_if_not(var_1_31 >= -31) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L190] CALL assume_abort_if_not(var_1_31 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L190] RET assume_abort_if_not(var_1_31 <= 31) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=4, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L191] var_1_32 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_32 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L192] RET assume_abort_if_not(var_1_32 >= -63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L193] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L193] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-25, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L194] var_1_33 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_33 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L195] RET assume_abort_if_not(var_1_33 >= -63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L196] CALL assume_abort_if_not(var_1_33 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L196] RET assume_abort_if_not(var_1_33 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L197] var_1_35 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L198] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L199] CALL assume_abort_if_not(var_1_35 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L199] RET assume_abort_if_not(var_1_35 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L216] RET updateVariables() [L217] CALL step() [L60] signed long int stepLocal_1 = last_1_var_1_29; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_1=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=64, var_1_8=-66, var_1_9=575] [L61] COND TRUE stepLocal_1 > ((((var_1_3) < (var_1_5)) ? (var_1_3) : (var_1_5))) [L62] var_1_7 = ((var_1_8 - var_1_9) - var_1_10) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L70] signed long int stepLocal_4 = (((var_1_8) > (var_1_10)) ? (var_1_8) : (var_1_10)); [L71] unsigned char stepLocal_3 = last_1_var_1_26; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L72] COND FALSE !(! last_1_var_1_12) [L81] var_1_23 = 16 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L83] unsigned char stepLocal_7 = var_1_23; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_3=1, stepLocal_4=190, stepLocal_7=16, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L84] COND TRUE stepLocal_7 < last_1_var_1_29 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L85] COND FALSE !(! var_1_13) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=1281/5, var_1_37=128, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L89] var_1_26 = (! (! var_1_13)) [L90] var_1_34 = var_1_35 [L91] var_1_36 = var_1_17 [L92] var_1_37 = var_1_8 [L93] signed long int stepLocal_2 = (((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=322/5, var_1_17=2, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L94] COND TRUE \read(var_1_26) [L95] var_1_14 = 49.5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_28=37/4, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L111] COND TRUE var_1_37 >= (var_1_8 - var_1_9) [L112] var_1_28 = ((var_1_17 - var_1_16) + var_1_20) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L116] unsigned char stepLocal_6 = var_1_9; [L117] unsigned char stepLocal_5 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_5=0, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=-5, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L118] COND FALSE !(stepLocal_5 < var_1_7) [L125] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L127] signed long int stepLocal_0 = ((((var_1_25 / var_1_3)) > ((var_1_7 % var_1_5))) ? ((var_1_25 / var_1_3)) : ((var_1_7 % var_1_5))); VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_0=1, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=5, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L128] COND TRUE stepLocal_0 != -16 [L129] var_1_1 = ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=8, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L133] COND TRUE \read(var_1_26) [L134] var_1_21 = (var_1_25 + (var_1_22 - (var_1_10 + var_1_9))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L136] COND TRUE \read(var_1_26) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=-5, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L137] COND TRUE var_1_5 <= var_1_3 [L138] var_1_27 = (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) + var_1_25) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=32, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L141] COND FALSE !(var_1_10 <= var_1_9) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, stepLocal_2=190, stepLocal_3=1, stepLocal_4=190, stepLocal_6=575, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=32, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L217] RET step() [L218] CALL, EXPR property() [L207] EXPR ((((((((((((var_1_25 / var_1_3)) > ((var_1_7 % var_1_5))) ? ((var_1_25 / var_1_3)) : ((var_1_7 % var_1_5)))) != -16) ? (var_1_1 == ((unsigned short int) ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))))) : (var_1_1 == ((unsigned short int) ((((var_1_23) > (32)) ? (var_1_23) : (32)))))) && ((last_1_var_1_29 > ((((var_1_3) < (var_1_5)) ? (var_1_3) : (var_1_5)))) ? (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - var_1_10))) : (last_1_var_1_12 ? (var_1_7 == ((unsigned char) var_1_10)) : (var_1_7 == ((unsigned char) var_1_10))))) && ((var_1_10 <= var_1_9) ? (((((((var_1_9) < (var_1_1)) ? (var_1_9) : (var_1_1))) * var_1_7) >= var_1_21) ? (var_1_12 == ((unsigned char) 0)) : (var_1_12 == ((unsigned char) var_1_13))) : 1)) && (var_1_26 ? (var_1_14 == ((double) 49.5)) : ((! var_1_13) ? (var_1_13 ? (var_1_14 == ((double) ((var_1_15 - var_1_16) - (7.960983332883285E18 - var_1_17)))) : (var_1_14 == ((double) (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17))) + (var_1_18 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) < var_1_37) ? (var_1_14 == ((double) var_1_18)) : (var_1_14 == ((double) var_1_18)))))) && (var_1_26 ? (var_1_21 == ((unsigned long int) (var_1_25 + (var_1_22 - (var_1_10 + var_1_9))))) : 1)) && ((! last_1_var_1_12) ? ((var_1_22 > ((((var_1_8) > (var_1_10)) ? (var_1_8) : (var_1_10)))) ? ((var_1_13 && last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_10)) : (var_1_23 == ((unsigned char) var_1_9))) : 1) : (var_1_23 == ((unsigned char) 16)))) && ((var_1_7 < var_1_7) ? (((var_1_22 << var_1_7) >= var_1_9) ? (var_1_25 == ((signed long int) var_1_23)) : (var_1_25 == ((signed long int) (var_1_7 - 32)))) : (var_1_25 == ((signed long int) var_1_23))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=32, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L207-L208] return (((((((((((((((((((var_1_25 / var_1_3)) > ((var_1_7 % var_1_5))) ? ((var_1_25 / var_1_3)) : ((var_1_7 % var_1_5)))) != -16) ? (var_1_1 == ((unsigned short int) ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))))) : (var_1_1 == ((unsigned short int) ((((var_1_23) > (32)) ? (var_1_23) : (32)))))) && ((last_1_var_1_29 > ((((var_1_3) < (var_1_5)) ? (var_1_3) : (var_1_5)))) ? (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - var_1_10))) : (last_1_var_1_12 ? (var_1_7 == ((unsigned char) var_1_10)) : (var_1_7 == ((unsigned char) var_1_10))))) && ((var_1_10 <= var_1_9) ? (((((((var_1_9) < (var_1_1)) ? (var_1_9) : (var_1_1))) * var_1_7) >= var_1_21) ? (var_1_12 == ((unsigned char) 0)) : (var_1_12 == ((unsigned char) var_1_13))) : 1)) && (var_1_26 ? (var_1_14 == ((double) 49.5)) : ((! var_1_13) ? (var_1_13 ? (var_1_14 == ((double) ((var_1_15 - var_1_16) - (7.960983332883285E18 - var_1_17)))) : (var_1_14 == ((double) (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17))) + (var_1_18 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) < var_1_37) ? (var_1_14 == ((double) var_1_18)) : (var_1_14 == ((double) var_1_18)))))) && (var_1_26 ? (var_1_21 == ((unsigned long int) (var_1_25 + (var_1_22 - (var_1_10 + var_1_9))))) : 1)) && ((! last_1_var_1_12) ? ((var_1_22 > ((((var_1_8) > (var_1_10)) ? (var_1_8) : (var_1_10)))) ? ((var_1_13 && last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_10)) : (var_1_23 == ((unsigned char) var_1_9))) : 1) : (var_1_23 == ((unsigned char) 16)))) && ((var_1_7 < var_1_7) ? (((var_1_22 << var_1_7) >= var_1_9) ? (var_1_25 == ((signed long int) var_1_23)) : (var_1_25 == ((signed long int) (var_1_7 - 32)))) : (var_1_25 == ((signed long int) var_1_23)))) && (var_1_26 == ((unsigned char) (! (! var_1_13))))) && (var_1_26 ? ((var_1_5 <= var_1_3) ? (var_1_27 == ((signed short int) (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) + var_1_25))) : 1) : 1)) && ((var_1_37 >= (var_1_8 - var_1_9)) ? (var_1_28 == ((float) ((var_1_17 - var_1_16) + var_1_20))) : (var_1_28 == ((float) ((((var_1_16) > (((((((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) > (63.4f)) ? (((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) : (63.4f))))) ? (var_1_16) : (((((((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) > (63.4f)) ? (((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) : (63.4f)))))))))) && ((var_1_23 < last_1_var_1_29) ? ((! var_1_13) ? (var_1_29 == ((signed char) ((((var_1_9) < (((var_1_30 + var_1_31) + ((((var_1_32) < (var_1_33)) ? (var_1_32) : (var_1_33)))))) ? (var_1_9) : (((var_1_30 + var_1_31) + ((((var_1_32) < (var_1_33)) ? (var_1_32) : (var_1_33))))))))) : 1) : 1)) && (var_1_34 == ((unsigned char) var_1_35))) && (var_1_36 == ((double) var_1_17))) && (var_1_37 == ((unsigned long int) var_1_8)) ; [L218] RET, EXPR property() [L218] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=32, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_26=1, last_1_var_1_29=32, var_1_10=-897, var_1_12=1, var_1_13=-255, var_1_14=99/2, var_1_17=2, var_1_1=16, var_1_21=-3221225647, var_1_22=-3221225473, var_1_23=16, var_1_25=16, var_1_26=1, var_1_27=32, var_1_29=32, var_1_30=-31, var_1_31=-31, var_1_32=-63, var_1_33=-63, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=190, var_1_3=15, var_1_5=1, var_1_7=0, var_1_8=-66, var_1_9=575] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 187 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 7, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 2303 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 148 IncrementalHoareTripleChecker+Unchecked, 1367 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 611 IncrementalHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 936 mSDtfsCounter, 611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=6, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 308 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 2023 NumberOfCodeBlocks, 2023 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1609 ConstructedInterpolants, 1 QuantifiedInterpolants, 3604 SizeOfPredicates, 4 NumberOfNonLiveVariables, 957 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 15654/15872 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-17 03:11:06,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.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 73080b6aad183930e4117faa4a34d2c3ffac40f8ac7f54624070c85760d249c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:11:07,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:11:07,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:11:07,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:11:07,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:11:08,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:11:08,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:11:08,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:11:08,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:11:08,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:11:08,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:11:08,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:11:08,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:11:08,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:11:08,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:11:08,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:11:08,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:11:08,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:11:08,009 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 -> 73080b6aad183930e4117faa4a34d2c3ffac40f8ac7f54624070c85760d249c9 [2025-03-17 03:11:08,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:11:08,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:11:08,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:11:08,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:11:08,238 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:11:08,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i [2025-03-17 03:11:09,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387e8cc2b/94792c059a5f4411b2ca749389df88ca/FLAG63105db85 [2025-03-17 03:11:09,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:11:09,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i [2025-03-17 03:11:09,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387e8cc2b/94792c059a5f4411b2ca749389df88ca/FLAG63105db85 [2025-03-17 03:11:09,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387e8cc2b/94792c059a5f4411b2ca749389df88ca [2025-03-17 03:11:09,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:11:09,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:11:09,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:11:09,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:11:09,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:11:09,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:09" (1/1) ... [2025-03-17 03:11:09,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b5357e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:09, skipping insertion in model container [2025-03-17 03:11:09,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:09" (1/1) ... [2025-03-17 03:11:10,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:11:10,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i[916,929] [2025-03-17 03:11:10,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:11:10,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:11:10,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-85.i[916,929] [2025-03-17 03:11:10,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:11:10,267 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:11:10,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10 WrapperNode [2025-03-17 03:11:10,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:11:10,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:11:10,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:11:10,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:11:10,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,306 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2025-03-17 03:11:10,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:11:10,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:11:10,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:11:10,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:11:10,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,335 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-17 03:11:10,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:11:10,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:11:10,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:11:10,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:11:10,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (1/1) ... [2025-03-17 03:11:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:11:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:11:10,381 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-17 03:11:10,386 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-17 03:11:10,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:11:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:11:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:11:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:11:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:11:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:11:10,479 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:11:10,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:11:23,482 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 03:11:23,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:11:23,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:11:23,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:11:23,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:23 BoogieIcfgContainer [2025-03-17 03:11:23,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:11:23,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:11:23,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:11:23,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:11:23,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:11:09" (1/3) ... [2025-03-17 03:11:23,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e54d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:23, skipping insertion in model container [2025-03-17 03:11:23,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:10" (2/3) ... [2025-03-17 03:11:23,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e54d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:23, skipping insertion in model container [2025-03-17 03:11:23,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:23" (3/3) ... [2025-03-17 03:11:23,505 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-85.i [2025-03-17 03:11:23,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:11:23,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-85.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:11:23,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:11:23,588 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;@1a1572fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:11:23,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:11:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:11:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 03:11:23,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:23,602 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:11:23,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1208585588, now seen corresponding path program 1 times [2025-03-17 03:11:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:11:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519434170] [2025-03-17 03:11:23,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:23,614 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-17 03:11:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:11:23,617 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-17 03:11:23,618 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-17 03:11:23,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 03:11:24,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 03:11:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:24,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:24,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:11:24,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-17 03:11:24,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:11:24,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:11:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519434170] [2025-03-17 03:11:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519434170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:11:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235404261] [2025-03-17 03:11:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:11:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:11:24,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:11:24,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:11:24,218 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 03:11:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:24,237 INFO L93 Difference]: Finished difference Result 175 states and 313 transitions. [2025-03-17 03:11:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:11:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2025-03-17 03:11:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:24,243 INFO L225 Difference]: With dead ends: 175 [2025-03-17 03:11:24,243 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 03:11:24,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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-17 03:11:24,248 INFO L435 NwaCegarLoop]: 139 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, 139 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-17 03:11:24,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:11:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 03:11:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 03:11:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:11:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2025-03-17 03:11:24,279 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 198 [2025-03-17 03:11:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:24,279 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2025-03-17 03:11:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 03:11:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2025-03-17 03:11:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-17 03:11:24,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:24,282 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:11:24,300 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-17 03:11:24,483 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-17 03:11:24,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1228615404, now seen corresponding path program 1 times [2025-03-17 03:11:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:11:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300346347] [2025-03-17 03:11:24,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:24,485 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-17 03:11:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:11:24,489 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-17 03:11:24,490 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-17 03:11:24,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 03:11:24,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 03:11:24,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:24,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:25,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:11:25,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 03:11:28,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:11:28,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:11:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300346347] [2025-03-17 03:11:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300346347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:11:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858457786] [2025-03-17 03:11:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:28,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:11:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:11:28,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:11:28,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:11:28,187 INFO L87 Difference]: Start difference. First operand 86 states and 137 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 03:11:33,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:37,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:41,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:45,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:49,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:53,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:11:57,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:12:01,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:12:05,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:12:09,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:12:13,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []