./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-47.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-while_file-47.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 515fa0718a592f1c0dc712f169febdb512c0008d113759f73c250509b5fadc4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:17:19,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:17:19,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:17:19,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:17:19,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:17:19,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:17:19,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:17:19,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:17:19,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:17:19,610 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:17:19,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:17:19,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:17:19,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:17:19,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:17:19,611 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:17:19,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:17:19,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:17:19,611 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:17:19,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:17:19,612 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:17:19,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:19,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:17:19,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:17:19,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:17:19,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:17:19,614 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 -> 515fa0718a592f1c0dc712f169febdb512c0008d113759f73c250509b5fadc4d [2025-03-17 03:17:19,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:17:19,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:17:19,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:17:19,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:17:19,880 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:17:19,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-47.i [2025-03-17 03:17:21,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3298645ee/2ebc1318ba3345c48f8299a66522a15f/FLAG215fc4b1f [2025-03-17 03:17:21,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:17:21,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-47.i [2025-03-17 03:17:21,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3298645ee/2ebc1318ba3345c48f8299a66522a15f/FLAG215fc4b1f [2025-03-17 03:17:21,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3298645ee/2ebc1318ba3345c48f8299a66522a15f [2025-03-17 03:17:21,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:17:21,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:17:21,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:21,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:17:21,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:17:21,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:21" (1/1) ... [2025-03-17 03:17:21,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16199cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:21, skipping insertion in model container [2025-03-17 03:17:21,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:21" (1/1) ... [2025-03-17 03:17:21,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:17:21,863 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-while_file-47.i[916,929] [2025-03-17 03:17:21,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:21,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:17:21,959 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-while_file-47.i[916,929] [2025-03-17 03:17:21,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:22,015 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:17:22,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22 WrapperNode [2025-03-17 03:17:22,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:22,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:22,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:17:22,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:17:22,024 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:17:22" (1/1) ... [2025-03-17 03:17:22,033 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:17:22" (1/1) ... [2025-03-17 03:17:22,056 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-17 03:17:22,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:22,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:17:22,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:17:22,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:17:22,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,089 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:17:22,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:17:22,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:17:22,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:17:22,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:17:22,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (1/1) ... [2025-03-17 03:17:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:22,141 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:17:22,144 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:17:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:17:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:17:22,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:17:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:17:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:17:22,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:17:22,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:17:22,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:17:22,686 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 03:17:22,688 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:17:22,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:17:22,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:17:22,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:22 BoogieIcfgContainer [2025-03-17 03:17:22,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:17:22,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:17:22,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:17:22,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:17:22,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:17:21" (1/3) ... [2025-03-17 03:17:22,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc0917d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:22, skipping insertion in model container [2025-03-17 03:17:22,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:22" (2/3) ... [2025-03-17 03:17:22,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc0917d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:22, skipping insertion in model container [2025-03-17 03:17:22,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:22" (3/3) ... [2025-03-17 03:17:22,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-47.i [2025-03-17 03:17:22,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:17:22,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-47.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:17:22,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:17:22,821 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;@21dae32f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:17:22,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:17:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 03:17:22,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:22,836 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:22,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash -586158476, now seen corresponding path program 1 times [2025-03-17 03:17:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805571340] [2025-03-17 03:17:22,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:22,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:17:22,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:17:22,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-17 03:17:23,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:23,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805571340] [2025-03-17 03:17:23,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805571340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:23,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372476661] [2025-03-17 03:17:23,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:23,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:23,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:23,233 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:17:23,235 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:17:23,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:17:23,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:17:23,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:23,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:17:23,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-17 03:17:23,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:17:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372476661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:23,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:17:23,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:17:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418975723] [2025-03-17 03:17:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:17:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:23,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:17:23,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:17:23,479 INFO L87 Difference]: Start difference. First operand has 92 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:17:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:23,506 INFO L93 Difference]: Finished difference Result 181 states and 329 transitions. [2025-03-17 03:17:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:17:23,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-17 03:17:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:23,513 INFO L225 Difference]: With dead ends: 181 [2025-03-17 03:17:23,514 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 03:17:23,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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:17:23,521 INFO L435 NwaCegarLoop]: 145 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, 145 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:17:23,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:17:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 03:17:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 03:17:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 145 transitions. [2025-03-17 03:17:23,562 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 145 transitions. Word has length 204 [2025-03-17 03:17:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:23,562 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 145 transitions. [2025-03-17 03:17:23,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:17:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 145 transitions. [2025-03-17 03:17:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 03:17:23,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:23,570 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:23,587 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:17:23,770 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:17:23,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2065521393, now seen corresponding path program 1 times [2025-03-17 03:17:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:23,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328417688] [2025-03-17 03:17:23,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:23,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:17:23,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:17:23,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:23,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328417688] [2025-03-17 03:17:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328417688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:24,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:17:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265647283] [2025-03-17 03:17:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:17:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:24,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:17:24,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:17:24,406 INFO L87 Difference]: Start difference. First operand 90 states and 145 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:24,450 INFO L93 Difference]: Finished difference Result 179 states and 289 transitions. [2025-03-17 03:17:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:17:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-17 03:17:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:24,457 INFO L225 Difference]: With dead ends: 179 [2025-03-17 03:17:24,457 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 03:17:24,458 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:17:24,461 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:24,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:17:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 03:17:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 03:17:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 144 transitions. [2025-03-17 03:17:24,481 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 144 transitions. Word has length 204 [2025-03-17 03:17:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:24,485 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 144 transitions. [2025-03-17 03:17:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 144 transitions. [2025-03-17 03:17:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:17:24,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:24,488 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:24,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:17:24,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1325099212, now seen corresponding path program 1 times [2025-03-17 03:17:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-03-17 03:17:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:24,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:17:24,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:17:24,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:24,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-03-17 03:17:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041959001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:17:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692915886] [2025-03-17 03:17:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:17:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:25,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:17:25,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:17:25,839 INFO L87 Difference]: Start difference. First operand 90 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:27,261 INFO L93 Difference]: Finished difference Result 330 states and 520 transitions. [2025-03-17 03:17:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:17:27,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-17 03:17:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:27,269 INFO L225 Difference]: With dead ends: 330 [2025-03-17 03:17:27,269 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 03:17:27,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:17:27,270 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 245 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:27,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 451 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 03:17:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 03:17:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2025-03-17 03:17:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 103 states have internal predecessors, (150), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:17:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 250 transitions. [2025-03-17 03:17:27,300 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 250 transitions. Word has length 205 [2025-03-17 03:17:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:27,301 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 250 transitions. [2025-03-17 03:17:27,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 250 transitions. [2025-03-17 03:17:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:17:27,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:27,303 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:17:27,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:27,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1196016493, now seen corresponding path program 1 times [2025-03-17 03:17:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567206888] [2025-03-17 03:17:27,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:27,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:17:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:17:27,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:27,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:27,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567206888] [2025-03-17 03:17:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567206888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:27,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:27,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:17:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497452099] [2025-03-17 03:17:27,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:17:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:27,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:17:27,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:17:27,406 INFO L87 Difference]: Start difference. First operand 155 states and 250 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:27,469 INFO L93 Difference]: Finished difference Result 447 states and 717 transitions. [2025-03-17 03:17:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:17:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-17 03:17:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:27,474 INFO L225 Difference]: With dead ends: 447 [2025-03-17 03:17:27,474 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 03:17:27,475 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:17:27,475 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 134 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 293 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:27,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 293 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:17:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 03:17:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2025-03-17 03:17:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 185 states have (on average 1.4) internal successors, (259), 187 states have internal predecessors, (259), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 03:17:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 459 transitions. [2025-03-17 03:17:27,536 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 459 transitions. Word has length 205 [2025-03-17 03:17:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:27,537 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 459 transitions. [2025-03-17 03:17:27,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 459 transitions. [2025-03-17 03:17:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:27,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:27,540 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:17:27,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1191572330, now seen corresponding path program 1 times [2025-03-17 03:17:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376539897] [2025-03-17 03:17:27,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:27,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:27,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:27,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376539897] [2025-03-17 03:17:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376539897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:17:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011964366] [2025-03-17 03:17:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:17:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:27,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:17:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:17:27,806 INFO L87 Difference]: Start difference. First operand 290 states and 459 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:28,084 INFO L93 Difference]: Finished difference Result 886 states and 1389 transitions. [2025-03-17 03:17:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:17:28,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 03:17:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:28,090 INFO L225 Difference]: With dead ends: 886 [2025-03-17 03:17:28,091 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 03:17:28,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:17:28,095 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 176 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:28,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 500 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:17:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 03:17:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 579. [2025-03-17 03:17:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 366 states have (on average 1.366120218579235) internal successors, (500), 372 states have internal predecessors, (500), 200 states have call successors, (200), 12 states have call predecessors, (200), 12 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 03:17:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 900 transitions. [2025-03-17 03:17:28,196 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 900 transitions. Word has length 206 [2025-03-17 03:17:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:28,196 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 900 transitions. [2025-03-17 03:17:28,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 900 transitions. [2025-03-17 03:17:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:28,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:28,198 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:28,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:17:28,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:28,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1306443607, now seen corresponding path program 1 times [2025-03-17 03:17:28,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:28,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020376185] [2025-03-17 03:17:28,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:28,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:28,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:28,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:28,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-17 03:17:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020376185] [2025-03-17 03:17:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020376185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900248639] [2025-03-17 03:17:28,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:28,741 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:17:28,742 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:17:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:28,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:28,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:28,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:28,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 03:17:28,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1275 proven. 81 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2025-03-17 03:17:29,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-17 03:17:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900248639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:17:30,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:17:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 7] total 20 [2025-03-17 03:17:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405315112] [2025-03-17 03:17:30,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:17:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 03:17:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:30,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 03:17:30,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:17:30,146 INFO L87 Difference]: Start difference. First operand 579 states and 900 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 6 states have call successors, (50), 4 states have call predecessors, (50), 8 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) [2025-03-17 03:17:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:31,336 INFO L93 Difference]: Finished difference Result 1173 states and 1755 transitions. [2025-03-17 03:17:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 03:17:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 6 states have call successors, (50), 4 states have call predecessors, (50), 8 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) Word has length 206 [2025-03-17 03:17:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:31,344 INFO L225 Difference]: With dead ends: 1173 [2025-03-17 03:17:31,345 INFO L226 Difference]: Without dead ends: 595 [2025-03-17 03:17:31,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1373, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 03:17:31,350 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 649 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:31,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 486 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:17:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-17 03:17:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2025-03-17 03:17:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 226 states have (on average 1.1814159292035398) internal successors, (267), 230 states have internal predecessors, (267), 141 states have call successors, (141), 19 states have call predecessors, (141), 19 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-17 03:17:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 549 transitions. [2025-03-17 03:17:31,426 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 549 transitions. Word has length 206 [2025-03-17 03:17:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:31,428 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 549 transitions. [2025-03-17 03:17:31,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 6 states have call successors, (50), 4 states have call predecessors, (50), 8 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) [2025-03-17 03:17:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 549 transitions. [2025-03-17 03:17:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:31,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:31,430 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:31,438 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:17:31,630 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:17:31,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:31,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1872552656, now seen corresponding path program 1 times [2025-03-17 03:17:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552640606] [2025-03-17 03:17:31,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:31,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:31,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:31,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:31,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552640606] [2025-03-17 03:17:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552640606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:17:32,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044558284] [2025-03-17 03:17:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:32,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:17:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:17:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:17:32,453 INFO L87 Difference]: Start difference. First operand 387 states and 549 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:32,846 INFO L93 Difference]: Finished difference Result 797 states and 1122 transitions. [2025-03-17 03:17:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:17:32,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 03:17:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:32,854 INFO L225 Difference]: With dead ends: 797 [2025-03-17 03:17:32,854 INFO L226 Difference]: Without dead ends: 442 [2025-03-17 03:17:32,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:17:32,856 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 127 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:32,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 496 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:17:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-17 03:17:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 423. [2025-03-17 03:17:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 246 states have internal predecessors, (275), 157 states have call successors, (157), 23 states have call predecessors, (157), 23 states have return successors, (157), 153 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-17 03:17:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 589 transitions. [2025-03-17 03:17:32,948 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 589 transitions. Word has length 206 [2025-03-17 03:17:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:32,949 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 589 transitions. [2025-03-17 03:17:32,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 589 transitions. [2025-03-17 03:17:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:32,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:32,951 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:32,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:17:32,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash -537053196, now seen corresponding path program 1 times [2025-03-17 03:17:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:32,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808702674] [2025-03-17 03:17:32,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:32,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:33,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:33,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:33,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 120 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2025-03-17 03:17:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:17:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808702674] [2025-03-17 03:17:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808702674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:33,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871033199] [2025-03-17 03:17:33,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:33,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:33,679 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:17:33,682 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:17:33,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:33,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:33,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:33,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:33,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 03:17:33,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 947 proven. 345 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-17 03:17:35,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 78 proven. 288 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked. [2025-03-17 03:17:36,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871033199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:17:36,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:17:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 16] total 39 [2025-03-17 03:17:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868182791] [2025-03-17 03:17:36,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:17:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 03:17:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:17:36,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 03:17:36,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 03:17:36,500 INFO L87 Difference]: Start difference. First operand 423 states and 589 transitions. Second operand has 39 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 34 states have internal predecessors, (123), 13 states have call successors, (91), 6 states have call predecessors, (91), 12 states have return successors, (92), 13 states have call predecessors, (92), 13 states have call successors, (92) [2025-03-17 03:17:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:40,535 INFO L93 Difference]: Finished difference Result 2102 states and 2658 transitions. [2025-03-17 03:17:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-17 03:17:40,536 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 34 states have internal predecessors, (123), 13 states have call successors, (91), 6 states have call predecessors, (91), 12 states have return successors, (92), 13 states have call predecessors, (92), 13 states have call successors, (92) Word has length 206 [2025-03-17 03:17:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:40,543 INFO L225 Difference]: With dead ends: 2102 [2025-03-17 03:17:40,544 INFO L226 Difference]: Without dead ends: 1751 [2025-03-17 03:17:40,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5257 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3228, Invalid=13028, Unknown=0, NotChecked=0, Total=16256 [2025-03-17 03:17:40,549 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 752 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:40,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1066 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 03:17:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-03-17 03:17:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1044. [2025-03-17 03:17:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 661 states have (on average 1.119515885022693) internal successors, (740), 670 states have internal predecessors, (740), 285 states have call successors, (285), 97 states have call predecessors, (285), 97 states have return successors, (285), 276 states have call predecessors, (285), 285 states have call successors, (285) [2025-03-17 03:17:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1310 transitions. [2025-03-17 03:17:40,766 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1310 transitions. Word has length 206 [2025-03-17 03:17:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1310 transitions. [2025-03-17 03:17:40,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 34 states have internal predecessors, (123), 13 states have call successors, (91), 6 states have call predecessors, (91), 12 states have return successors, (92), 13 states have call predecessors, (92), 13 states have call successors, (92) [2025-03-17 03:17:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1310 transitions. [2025-03-17 03:17:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:40,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:40,769 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:40,778 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:17:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:40,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1047587373, now seen corresponding path program 1 times [2025-03-17 03:17:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:17:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7865308] [2025-03-17 03:17:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:17:40,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:41,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:41,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:41,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:17:41,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98378538] [2025-03-17 03:17:41,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:41,127 INFO L229 MonitoredProcess]: Starting monitored process 5 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:17:41,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 03:17:41,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:41,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:41,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:41,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:17:41,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:17:41,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:41,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:41,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:41,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:17:41,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:17:41,418 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:17:41,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:17:41,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:17:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:17:41,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:17:41,740 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:17:41,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:17:41 BoogieIcfgContainer [2025-03-17 03:17:41,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:17:41,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:17:41,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:17:41,744 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:17:41,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:22" (3/4) ... [2025-03-17 03:17:41,749 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:17:41,750 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:17:41,751 INFO L158 Benchmark]: Toolchain (without parser) took 20028.03ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 130.9MB in the beginning and 245.1MB in the end (delta: -114.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.41ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 113.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.42ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 109.8MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: Boogie Preprocessor took 52.38ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 103.9MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: IcfgBuilder took 594.48ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 73.1MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: TraceAbstraction took 19036.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 72.8MB in the beginning and 245.2MB in the end (delta: -172.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2025-03-17 03:17:41,751 INFO L158 Benchmark]: Witness Printer took 6.43ms. Allocated memory is still 352.3MB. Free memory was 245.2MB in the beginning and 245.1MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:17:41,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.41ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 113.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.42ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 109.8MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.38ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 103.9MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 594.48ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 73.1MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19036.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 72.8MB in the beginning and 245.2MB in the end (delta: -172.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Witness Printer took 6.43ms. Allocated memory is still 352.3MB. Free memory was 245.2MB in the beginning and 245.1MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 229. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 5; [L23] signed char var_1_3 = -32; [L24] unsigned long int var_1_6 = 10; [L25] unsigned short int var_1_11 = 32; [L26] unsigned short int var_1_13 = 10; [L27] unsigned short int var_1_14 = 0; [L28] signed short int var_1_15 = -128; [L29] signed short int var_1_16 = 4; [L30] signed short int var_1_17 = 128; [L31] double var_1_18 = 0.6; [L32] double var_1_19 = 4.3; [L33] double var_1_20 = 64.2; [L34] double var_1_21 = 200.6; [L35] unsigned long int var_1_22 = 100000; [L36] unsigned long int var_1_23 = 32; [L37] unsigned long int var_1_24 = 1251238951; [L38] unsigned long int var_1_25 = 3528560962; [L39] unsigned char var_1_26 = 0; [L40] unsigned long int var_1_27 = 3248462006; [L41] unsigned char var_1_28 = 1; [L42] unsigned char var_1_29 = 0; [L43] signed char var_1_30 = -4; [L44] signed char var_1_31 = 2; [L45] signed char var_1_32 = 100; [L46] signed char var_1_33 = -32; [L47] signed char var_1_34 = -8; [L48] unsigned char var_1_35 = 1; [L49] unsigned char var_1_36 = 0; [L50] signed char var_1_37 = -25; [L51] signed char var_1_38 = 8; [L52] unsigned long int last_1_var_1_6 = 10; [L53] unsigned short int last_1_var_1_11 = 32; [L54] unsigned short int last_1_var_1_14 = 0; [L55] unsigned long int last_1_var_1_22 = 100000; [L56] unsigned char last_1_var_1_26 = 0; [L57] unsigned char last_1_var_1_35 = 1; [L233] isInitial = 1 [L234] FCALL initially() [L235] COND TRUE 1 [L236] CALL updateLastVariables() [L221] last_1_var_1_6 = var_1_6 [L222] last_1_var_1_11 = var_1_11 [L223] last_1_var_1_14 = var_1_14 [L224] last_1_var_1_22 = var_1_22 [L225] last_1_var_1_26 = var_1_26 [L226] last_1_var_1_35 = var_1_35 [L236] RET updateLastVariables() [L237] CALL updateVariables() [L168] var_1_3 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_3 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=10, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=10, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L169] RET assume_abort_if_not(var_1_3 >= -126) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=10, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L170] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=10, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=10, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L170] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=10, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L171] var_1_13 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L172] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L173] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L173] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=4, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L174] var_1_16 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L175] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L176] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L176] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=128, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L177] var_1_17 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L178] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L179] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L179] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_19=43/10, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L180] var_1_19 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L181] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_20=321/5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L182] var_1_20 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L183] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_21=1003/5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L184] var_1_21 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L185] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1251238951, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L186] var_1_24 = __VERIFIER_nondet_ulong() [L187] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L187] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L188] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L188] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=3528560962, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L189] var_1_25 = __VERIFIER_nondet_ulong() [L190] CALL assume_abort_if_not(var_1_25 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L190] RET assume_abort_if_not(var_1_25 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L191] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L191] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=3248462006, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L192] var_1_27 = __VERIFIER_nondet_ulong() [L193] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L193] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L194] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L194] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=1, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L195] var_1_28 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L196] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L197] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L197] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=0, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L198] var_1_29 = __VERIFIER_nondet_uchar() [L199] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L199] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L200] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L200] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=2, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L201] var_1_31 = __VERIFIER_nondet_char() [L202] CALL assume_abort_if_not(var_1_31 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L202] RET assume_abort_if_not(var_1_31 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L203] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L203] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=100, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L204] var_1_32 = __VERIFIER_nondet_char() [L205] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L205] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L206] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L206] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-32, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L207] var_1_33 = __VERIFIER_nondet_char() [L208] CALL assume_abort_if_not(var_1_33 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L208] RET assume_abort_if_not(var_1_33 >= -63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L209] CALL assume_abort_if_not(var_1_33 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L209] RET assume_abort_if_not(var_1_33 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-8, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L210] var_1_34 = __VERIFIER_nondet_char() [L211] CALL assume_abort_if_not(var_1_34 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L211] RET assume_abort_if_not(var_1_34 >= -63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L212] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L212] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L213] var_1_36 = __VERIFIER_nondet_uchar() [L214] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L214] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L215] CALL assume_abort_if_not(var_1_36 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L215] RET assume_abort_if_not(var_1_36 <= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=8, var_1_3=126, var_1_6=10] [L216] var_1_38 = __VERIFIER_nondet_char() [L217] CALL assume_abort_if_not(var_1_38 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L217] RET assume_abort_if_not(var_1_38 >= -127) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L218] CALL assume_abort_if_not(var_1_38 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L218] RET assume_abort_if_not(var_1_38 <= 126) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L237] RET updateVariables() [L238] CALL step() [L61] signed long int stepLocal_5 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_5=0, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=32, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L62] COND TRUE last_1_var_1_6 > stepLocal_5 [L63] var_1_23 = (var_1_16 + (var_1_24 - var_1_13)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L69] unsigned long int stepLocal_2 = last_1_var_1_22 + last_1_var_1_22; [L70] unsigned char stepLocal_1 = last_1_var_1_26; [L71] unsigned long int stepLocal_0 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_2=200000, var_1_11=32, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L72] COND FALSE !(last_1_var_1_14 > stepLocal_2) [L81] var_1_11 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, var_1_11=8, var_1_13=8, var_1_14=0, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=3/5, var_1_1=5, var_1_22=100000, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L83] var_1_14 = var_1_13 [L84] var_1_18 = ((((var_1_19) > ((((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) < 0 ) ? -((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) : ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))))) ? (var_1_19) : ((((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) < 0 ) ? -((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) : ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) [L85] signed long int stepLocal_4 = 0; [L86] unsigned short int stepLocal_3 = var_1_13; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_3=8, stepLocal_4=0, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=100000, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L87] COND TRUE var_1_14 <= stepLocal_3 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_4=0, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=100000, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L88] COND FALSE !(stepLocal_4 >= var_1_23) [L91] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L94] unsigned short int stepLocal_7 = var_1_13; [L95] unsigned long int stepLocal_6 = var_1_25; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_6=2147483647, stepLocal_7=8, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=0, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L96] COND TRUE stepLocal_6 < (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - var_1_22) [L97] var_1_26 = (var_1_28 && var_1_29) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L107] COND TRUE \read(var_1_26) [L108] var_1_35 = (! var_1_36) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=10] [L112] COND TRUE \read(var_1_35) [L113] var_1_6 = ((((8u) > (var_1_11)) ? (8u) : (var_1_11))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L119] COND TRUE \read(var_1_26) [L120] var_1_1 = (((((((10) < (var_1_3)) ? (10) : (var_1_3))) < 0 ) ? -((((10) < (var_1_3)) ? (10) : (var_1_3))) : ((((10) < (var_1_3)) ? (10) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=-128, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L132] COND TRUE \read(var_1_35) [L133] var_1_15 = (var_1_3 + (var_1_16 - ((((var_1_17) < (2)) ? (var_1_17) : (2))))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L137] unsigned short int stepLocal_10 = var_1_11; [L138] unsigned char stepLocal_9 = var_1_26; [L139] signed long int stepLocal_8 = ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) - var_1_32; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_10=8, stepLocal_1=0, stepLocal_7=8, stepLocal_8=3396, stepLocal_9=1, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L140] COND FALSE !(var_1_6 < stepLocal_10) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, stepLocal_8=3396, stepLocal_9=1, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L147] COND FALSE !(stepLocal_8 <= var_1_34) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, stepLocal_9=1, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L155] unsigned short int stepLocal_12 = var_1_13; [L156] unsigned char stepLocal_11 = var_1_35; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_11=1, stepLocal_12=8, stepLocal_1=0, stepLocal_7=8, stepLocal_9=1, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L157] COND TRUE stepLocal_11 && var_1_28 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_12=8, stepLocal_1=0, stepLocal_7=8, stepLocal_9=1, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=-25, var_1_38=1, var_1_3=126, var_1_6=8] [L158] COND TRUE stepLocal_12 != var_1_27 [L159] var_1_37 = ((((var_1_3) < (var_1_32)) ? (var_1_3) : (var_1_32))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, stepLocal_0=100000, stepLocal_1=0, stepLocal_7=8, stepLocal_9=1, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_3=126, var_1_6=8] [L238] RET step() [L239] CALL, EXPR property() [L229-L230] return (((((((((((var_1_26 ? (var_1_1 == ((signed char) (((((((10) < (var_1_3)) ? (10) : (var_1_3))) < 0 ) ? -((((10) < (var_1_3)) ? (10) : (var_1_3))) : ((((10) < (var_1_3)) ? (10) : (var_1_3))))))) : (var_1_35 ? (var_1_26 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_3))) : (var_1_1 == ((signed char) var_1_3)))) && (var_1_35 ? (var_1_6 == ((unsigned long int) ((((8u) > (var_1_11)) ? (8u) : (var_1_11))))) : ((var_1_11 > var_1_14) ? (var_1_6 == ((unsigned long int) ((((var_1_14) > ((3173943110u - var_1_11))) ? (var_1_14) : ((3173943110u - var_1_11)))))) : 1))) && ((last_1_var_1_14 > (last_1_var_1_22 + last_1_var_1_22)) ? ((last_1_var_1_11 != last_1_var_1_22) ? ((last_1_var_1_26 && last_1_var_1_26) ? (var_1_11 == ((unsigned short int) var_1_13)) : (var_1_11 == ((unsigned short int) var_1_13))) : 1) : (var_1_11 == ((unsigned short int) var_1_13)))) && (var_1_14 == ((unsigned short int) var_1_13))) && (var_1_35 ? (var_1_15 == ((signed short int) (var_1_3 + (var_1_16 - ((((var_1_17) < (2)) ? (var_1_17) : (2))))))) : (var_1_15 == ((signed short int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))))) && (var_1_18 == ((double) ((((var_1_19) > ((((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) < 0 ) ? -((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) : ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))))) ? (var_1_19) : ((((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) < 0 ) ? -((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) : ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))))))))) && ((var_1_14 <= var_1_13) ? ((0 >= var_1_23) ? (var_1_22 == ((unsigned long int) var_1_11)) : (var_1_22 == ((unsigned long int) var_1_13))) : 1)) && ((last_1_var_1_6 > last_1_var_1_14) ? (var_1_23 == ((unsigned long int) (var_1_16 + (var_1_24 - var_1_13)))) : (last_1_var_1_35 ? (var_1_23 == ((unsigned long int) (var_1_25 - (1448097314u - var_1_13)))) : 1))) && ((var_1_25 < (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - var_1_22)) ? (var_1_26 == ((unsigned char) (var_1_28 && var_1_29))) : (var_1_28 ? ((var_1_11 <= var_1_13) ? (var_1_26 == ((unsigned char) var_1_29)) : (var_1_26 == ((unsigned char) var_1_29))) : 1))) && ((var_1_6 < var_1_11) ? ((((((var_1_18) < (3.75f)) ? (var_1_18) : (3.75f))) >= var_1_20) ? (var_1_30 == ((signed char) ((((var_1_3) > (((((-16) < ((var_1_31 - var_1_32))) ? (-16) : ((var_1_31 - var_1_32)))))) ? (var_1_3) : (((((-16) < ((var_1_31 - var_1_32))) ? (-16) : ((var_1_31 - var_1_32))))))))) : (var_1_30 == ((signed char) ((((var_1_33 + var_1_34) < 0 ) ? -(var_1_33 + var_1_34) : (var_1_33 + var_1_34)))))) : (((((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) - var_1_32) <= var_1_34) ? ((var_1_26 && ((var_1_11 * var_1_22) <= var_1_6)) ? (var_1_30 == ((signed char) ((((var_1_34) > (var_1_31)) ? (var_1_34) : (var_1_31))))) : (var_1_30 == ((signed char) var_1_33))) : 1))) && (var_1_26 ? (var_1_35 == ((unsigned char) (! var_1_36))) : (var_1_35 == ((unsigned char) ((var_1_3 > var_1_23) || var_1_28))))) && ((var_1_35 && var_1_28) ? ((var_1_13 != var_1_27) ? (var_1_37 == ((signed char) ((((var_1_3) < (var_1_32)) ? (var_1_3) : (var_1_32))))) : (var_1_37 == ((signed char) var_1_31))) : (var_1_37 == ((signed char) var_1_38))) ; [L239] RET, EXPR property() [L239] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_3=126, var_1_6=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=0, last_1_var_1_22=100000, last_1_var_1_26=0, last_1_var_1_35=1, last_1_var_1_6=10, var_1_11=8, var_1_13=8, var_1_14=8, var_1_15=124, var_1_16=0, var_1_17=3396, var_1_18=2, var_1_19=2, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=1073741817, var_1_24=1073741825, var_1_25=2147483647, var_1_26=1, var_1_27=-2147483640, var_1_28=-255, var_1_29=1, var_1_30=-4, var_1_31=1, var_1_32=0, var_1_33=-63, var_1_34=-63, var_1_35=1, var_1_36=0, var_1_37=0, var_1_38=1, var_1_3=126, var_1_6=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 182 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2086 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2083 mSDsluCounter, 3716 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2385 mSDsCounter, 937 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3078 IncrementalHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 937 mSolverCounterUnsat, 1331 mSDtfsCounter, 3078 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1202 GetRequests, 1022 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5672 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1044occurred in iteration=8, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 1041 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2670 NumberOfCodeBlocks, 2670 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2657 ConstructedInterpolants, 0 QuantifiedInterpolants, 9311 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1513 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 26546/27456 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:17:41,799 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-while_file-47.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 515fa0718a592f1c0dc712f169febdb512c0008d113759f73c250509b5fadc4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:17:44,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:17:44,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:17:44,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:17:44,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:17:44,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:17:44,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:17:44,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:17:44,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:17:44,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:17:44,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:17:44,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:17:44,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:17:44,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:17:44,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:17:44,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:17:44,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:44,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:17:44,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:17:44,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:17:44,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:17:44,156 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 -> 515fa0718a592f1c0dc712f169febdb512c0008d113759f73c250509b5fadc4d [2025-03-17 03:17:44,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:17:44,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:17:44,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:17:44,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:17:44,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:17:44,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-47.i [2025-03-17 03:17:45,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c39acb6/4cddc00bff2b4c2489edbae1bfa651f9/FLAG24622ee1d [2025-03-17 03:17:46,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:17:46,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-47.i [2025-03-17 03:17:46,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c39acb6/4cddc00bff2b4c2489edbae1bfa651f9/FLAG24622ee1d [2025-03-17 03:17:46,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c39acb6/4cddc00bff2b4c2489edbae1bfa651f9 [2025-03-17 03:17:46,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:17:46,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:17:46,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:46,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:17:46,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:17:46,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34874b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46, skipping insertion in model container [2025-03-17 03:17:46,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:17:46,258 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-while_file-47.i[916,929] [2025-03-17 03:17:46,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:46,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:17:46,397 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-while_file-47.i[916,929] [2025-03-17 03:17:46,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:46,479 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:17:46,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46 WrapperNode [2025-03-17 03:17:46,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:46,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:46,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:17:46,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:17:46,487 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:17:46" (1/1) ... [2025-03-17 03:17:46,499 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:17:46" (1/1) ... [2025-03-17 03:17:46,539 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2025-03-17 03:17:46,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:46,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:17:46,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:17:46,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:17:46,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,585 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:17:46,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:17:46,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:17:46,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:17:46,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:17:46,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (1/1) ... [2025-03-17 03:17:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:46,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:46,665 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:17:46,670 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:17:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:17:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:17:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:17:46,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:17:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:17:46,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:17:46,780 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:17:46,781 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:17:47,314 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 03:17:47,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:17:47,324 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:17:47,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:17:47,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:47 BoogieIcfgContainer [2025-03-17 03:17:47,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:17:47,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:17:47,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:17:47,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:17:47,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:17:46" (1/3) ... [2025-03-17 03:17:47,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521da25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:47, skipping insertion in model container [2025-03-17 03:17:47,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:46" (2/3) ... [2025-03-17 03:17:47,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521da25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:17:47, skipping insertion in model container [2025-03-17 03:17:47,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:17:47" (3/3) ... [2025-03-17 03:17:47,335 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-47.i [2025-03-17 03:17:47,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:17:47,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-47.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:17:47,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:17:47,440 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;@4c1a3fec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:17:47,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:17:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 03:17:47,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:47,454 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -586158476, now seen corresponding path program 1 times [2025-03-17 03:17:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:47,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636360553] [2025-03-17 03:17:47,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:47,469 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:17:47,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:47,475 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:17:47,477 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:17:47,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:17:47,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:17:47,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:47,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:47,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:17:47,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-03-17 03:17:47,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:17:47,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636360553] [2025-03-17 03:17:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636360553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:47,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:17:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370719747] [2025-03-17 03:17:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:17:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:17:47,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:17:47,848 INFO L87 Difference]: Start difference. First operand has 92 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:17:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:47,872 INFO L93 Difference]: Finished difference Result 181 states and 329 transitions. [2025-03-17 03:17:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:17:47,875 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-17 03:17:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:47,881 INFO L225 Difference]: With dead ends: 181 [2025-03-17 03:17:47,881 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 03:17:47,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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:17:47,886 INFO L435 NwaCegarLoop]: 145 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, 145 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:17:47,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:17:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 03:17:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 03:17:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 145 transitions. [2025-03-17 03:17:47,918 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 145 transitions. Word has length 204 [2025-03-17 03:17:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:47,918 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 145 transitions. [2025-03-17 03:17:47,918 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 03:17:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 145 transitions. [2025-03-17 03:17:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 03:17:47,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:47,922 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,932 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:17:48,123 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:17:48,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:48,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2065521393, now seen corresponding path program 1 times [2025-03-17 03:17:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:48,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694952415] [2025-03-17 03:17:48,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:48,127 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:17:48,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:48,131 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:17:48,136 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:17:48,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:17:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:17:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:48,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:17:48,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1223 proven. 48 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-03-17 03:17:48,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 138 proven. 51 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2025-03-17 03:17:49,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694952415] [2025-03-17 03:17:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694952415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:17:49,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:17:49,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-17 03:17:49,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839484336] [2025-03-17 03:17:49,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:17:49,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 03:17:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:49,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 03:17:49,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-17 03:17:49,354 INFO L87 Difference]: Start difference. First operand 90 states and 145 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 3 states have call successors, (48), 3 states have call predecessors, (48), 7 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-17 03:17:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:50,488 INFO L93 Difference]: Finished difference Result 194 states and 300 transitions. [2025-03-17 03:17:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 03:17:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 3 states have call successors, (48), 3 states have call predecessors, (48), 7 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 204 [2025-03-17 03:17:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:50,496 INFO L225 Difference]: With dead ends: 194 [2025-03-17 03:17:50,496 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 03:17:50,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:17:50,498 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 233 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:50,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 419 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:17:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 03:17:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-03-17 03:17:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-03-17 03:17:50,519 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 204 [2025-03-17 03:17:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:50,520 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-03-17 03:17:50,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 3 states have call successors, (48), 3 states have call predecessors, (48), 7 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-17 03:17:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-03-17 03:17:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:17:50,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:50,525 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:50,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:17:50,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:50,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash -392390989, now seen corresponding path program 1 times [2025-03-17 03:17:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925844401] [2025-03-17 03:17:50,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:50,728 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:17:50,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:50,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:17:50,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:17:50,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:17:50,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:17:50,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:50,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:50,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 03:17:50,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:50,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:17:50,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925844401] [2025-03-17 03:17:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925844401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:17:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677586327] [2025-03-17 03:17:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:17:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:50,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:17:50,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:17:50,977 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:51,060 INFO L93 Difference]: Finished difference Result 201 states and 293 transitions. [2025-03-17 03:17:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:17:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-17 03:17:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:51,067 INFO L225 Difference]: With dead ends: 201 [2025-03-17 03:17:51,067 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 03:17:51,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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:17:51,069 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:51,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:17:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 03:17:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 03:17:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2025-03-17 03:17:51,084 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 205 [2025-03-17 03:17:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:51,084 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2025-03-17 03:17:51,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2025-03-17 03:17:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:51,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:51,086 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:51,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:17:51,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:17:51,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:51,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1872552656, now seen corresponding path program 1 times [2025-03-17 03:17:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148089940] [2025-03-17 03:17:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:51,289 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:17:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:51,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:17:51,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:17:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:51,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:51,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:51,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:51,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 03:17:51,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 03:17:51,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:17:51,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148089940] [2025-03-17 03:17:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148089940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:17:51,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:17:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:17:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674634753] [2025-03-17 03:17:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:17:51,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:17:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:51,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:17:51,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:17:51,593 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:52,052 INFO L93 Difference]: Finished difference Result 283 states and 410 transitions. [2025-03-17 03:17:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:17:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 03:17:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:52,055 INFO L225 Difference]: With dead ends: 283 [2025-03-17 03:17:52,055 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 03:17:52,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 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:17:52,056 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 127 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:52,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 505 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:17:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 03:17:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 100. [2025-03-17 03:17:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 03:17:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2025-03-17 03:17:52,085 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 206 [2025-03-17 03:17:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:52,085 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2025-03-17 03:17:52,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 03:17:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2025-03-17 03:17:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:52,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:52,087 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:52,094 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 (5)] Ended with exit code 0 [2025-03-17 03:17:52,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:17:52,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:52,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash -537053196, now seen corresponding path program 1 times [2025-03-17 03:17:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259288937] [2025-03-17 03:17:52,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:52,289 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:17:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:52,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:17:52,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 03:17:52,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:52,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:52,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:52,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:52,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 03:17:52,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1060 proven. 198 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2025-03-17 03:17:53,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:53,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:17:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259288937] [2025-03-17 03:17:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259288937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1404166294] [2025-03-17 03:17:53,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:53,514 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:17:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:17:53,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:17:53,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 03:17:53,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:54,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:54,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:54,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:54,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:17:54,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:17:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1060 proven. 198 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2025-03-17 03:17:55,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:17:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1404166294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:17:55,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:17:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2025-03-17 03:17:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179487157] [2025-03-17 03:17:55,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:17:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:17:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:17:55,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:17:55,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-17 03:17:55,477 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (33), 4 states have call predecessors, (33), 6 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-17 03:17:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:17:58,578 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2025-03-17 03:17:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 03:17:58,580 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (33), 4 states have call predecessors, (33), 6 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 206 [2025-03-17 03:17:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:17:58,583 INFO L225 Difference]: With dead ends: 330 [2025-03-17 03:17:58,583 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 03:17:58,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2025-03-17 03:17:58,587 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 331 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:17:58,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 693 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 03:17:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 03:17:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2025-03-17 03:17:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 140 states have (on average 1.207142857142857) internal successors, (169), 140 states have internal predecessors, (169), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 03:17:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 301 transitions. [2025-03-17 03:17:58,639 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 301 transitions. Word has length 206 [2025-03-17 03:17:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:17:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 301 transitions. [2025-03-17 03:17:58,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (33), 4 states have call predecessors, (33), 6 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-17 03:17:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 301 transitions. [2025-03-17 03:17:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:17:58,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:17:58,642 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:58,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-03-17 03:17:58,851 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 (6)] Ended with exit code 0 [2025-03-17 03:17:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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:17:59,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:17:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:17:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1047587373, now seen corresponding path program 1 times [2025-03-17 03:17:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:17:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605121738] [2025-03-17 03:17:59,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:17:59,044 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:17:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:17:59,045 INFO L229 MonitoredProcess]: Starting monitored process 8 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:17:59,047 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 (8)] Waiting until timeout for monitored process [2025-03-17 03:17:59,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:17:59,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:17:59,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:17:59,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:17:59,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-17 03:17:59,307 INFO L279 TraceCheckSpWp]: Computing forward predicates...