./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-37.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 82983888234bfc7ff4512a899a5dc395d77164a6c3d94b0d7f8ec44d066bed1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:57:19,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:57:19,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:57:19,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:57:19,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:57:19,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:57:19,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:57:19,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:57:19,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:57:19,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:57:19,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:57:19,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:57:19,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:57:19,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:57:19,441 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:57:19,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:57:19,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:57:19,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:57:19,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:57:19,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:57:19,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:57:19,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:57:19,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:57:19,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:57:19,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:57:19,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:57:19,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:57:19,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:57:19,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:57:19,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:57:19,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:57:19,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:57:19,444 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 -> 82983888234bfc7ff4512a899a5dc395d77164a6c3d94b0d7f8ec44d066bed1e [2025-03-03 22:57:19,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:57:19,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:57:19,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:57:19,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:57:19,686 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:57:19,687 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-37.i [2025-03-03 22:57:20,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf048cfb/833a17cc306d40e6bd363d6eb268d1c8/FLAG152b66102 [2025-03-03 22:57:21,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:57:21,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-37.i [2025-03-03 22:57:21,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf048cfb/833a17cc306d40e6bd363d6eb268d1c8/FLAG152b66102 [2025-03-03 22:57:21,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf048cfb/833a17cc306d40e6bd363d6eb268d1c8 [2025-03-03 22:57:21,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:57:21,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:57:21,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:57:21,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:57:21,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:57:21,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765edc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21, skipping insertion in model container [2025-03-03 22:57:21,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:57:21,526 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-37.i[916,929] [2025-03-03 22:57:21,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:57:21,590 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:57:21,599 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-37.i[916,929] [2025-03-03 22:57:21,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:57:21,658 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:57:21,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21 WrapperNode [2025-03-03 22:57:21,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:57:21,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:57:21,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:57:21,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:57:21,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,698 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2025-03-03 22:57:21,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:57:21,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:57:21,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:57:21,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:57:21,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:57:21,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:57:21,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:57:21,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:57:21,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:57:21,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (1/1) ... [2025-03-03 22:57:21,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:57:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:21,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:57:21,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:57:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:57:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:57:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:57:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:57:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:57:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:57:21,851 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:57:21,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:57:22,175 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~ite19#1;havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2025-03-03 22:57:22,199 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-03 22:57:22,199 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:57:22,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:57:22,219 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:57:22,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:22 BoogieIcfgContainer [2025-03-03 22:57:22,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:57:22,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:57:22,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:57:22,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:57:22,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:57:21" (1/3) ... [2025-03-03 22:57:22,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fd8fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:22, skipping insertion in model container [2025-03-03 22:57:22,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:21" (2/3) ... [2025-03-03 22:57:22,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fd8fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:22, skipping insertion in model container [2025-03-03 22:57:22,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:22" (3/3) ... [2025-03-03 22:57:22,227 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-37.i [2025-03-03 22:57:22,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:57:22,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-37.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:57:22,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:57:22,292 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;@473ca47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:57:22,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:57:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:57:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:57:22,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:22,307 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:22,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 361522930, now seen corresponding path program 1 times [2025-03-03 22:57:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895603988] [2025-03-03 22:57:22,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:22,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:57:22,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:57:22,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:22,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:57:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895603988] [2025-03-03 22:57:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895603988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844449996] [2025-03-03 22:57:22,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:22,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:22,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:57:22,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:57:22,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:57:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:22,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:57:22,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:57:22,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:57:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844449996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:57:22,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:57:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553503539] [2025-03-03 22:57:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:22,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:57:22,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:22,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:57:22,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:57:22,836 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:57:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:22,865 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-03-03 22:57:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:57:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-03 22:57:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:22,874 INFO L225 Difference]: With dead ends: 178 [2025-03-03 22:57:22,875 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 22:57:22,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:57:22,879 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:22,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:57:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 22:57:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 22:57:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:57:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-03-03 22:57:22,907 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 137 [2025-03-03 22:57:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:22,907 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-03-03 22:57:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:57:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-03-03 22:57:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:57:22,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:22,910 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:22,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:57:23,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:57:23,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:23,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash -30673200, now seen corresponding path program 1 times [2025-03-03 22:57:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:23,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600852682] [2025-03-03 22:57:23,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:23,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:23,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:57:23,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:57:23,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:23,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:57:23,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:23,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600852682] [2025-03-03 22:57:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600852682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:23,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:57:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:57:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227724872] [2025-03-03 22:57:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:23,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:57:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:23,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:57:23,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:57:23,352 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:57:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:23,467 INFO L93 Difference]: Finished difference Result 258 states and 405 transitions. [2025-03-03 22:57:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:57:23,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 22:57:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:23,472 INFO L225 Difference]: With dead ends: 258 [2025-03-03 22:57:23,472 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 22:57:23,472 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-03 22:57:23,473 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 124 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:23,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 283 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:57:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 22:57:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-03 22:57:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:57:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 263 transitions. [2025-03-03 22:57:23,499 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 263 transitions. Word has length 137 [2025-03-03 22:57:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:23,500 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 263 transitions. [2025-03-03 22:57:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:57:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 263 transitions. [2025-03-03 22:57:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:57:23,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:23,501 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:23,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:57:23,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 806347879, now seen corresponding path program 1 times [2025-03-03 22:57:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891264011] [2025-03-03 22:57:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:23,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:57:23,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:57:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:57:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891264011] [2025-03-03 22:57:24,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891264011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:24,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:57:24,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:57:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423728375] [2025-03-03 22:57:24,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:57:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:24,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:57:24,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:57:24,351 INFO L87 Difference]: Start difference. First operand 170 states and 263 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:57:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:24,641 INFO L93 Difference]: Finished difference Result 394 states and 603 transitions. [2025-03-03 22:57:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:57:24,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-03 22:57:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:24,644 INFO L225 Difference]: With dead ends: 394 [2025-03-03 22:57:24,646 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 22:57:24,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:57:24,648 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 189 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:24,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1120 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:57:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 22:57:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 222. [2025-03-03 22:57:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 173 states have (on average 1.4104046242774566) internal successors, (244), 174 states have internal predecessors, (244), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 22:57:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 332 transitions. [2025-03-03 22:57:24,683 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 332 transitions. Word has length 138 [2025-03-03 22:57:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:24,683 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 332 transitions. [2025-03-03 22:57:24,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:57:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 332 transitions. [2025-03-03 22:57:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 22:57:24,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:24,685 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:24,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:57:24,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:24,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1649767506, now seen corresponding path program 1 times [2025-03-03 22:57:24,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:24,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285653210] [2025-03-03 22:57:24,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:24,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:24,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 22:57:24,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 22:57:24,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:24,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:57:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285653210] [2025-03-03 22:57:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285653210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:25,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:57:25,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:57:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316207234] [2025-03-03 22:57:25,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:25,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:57:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:25,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:57:25,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:57:25,204 INFO L87 Difference]: Start difference. First operand 222 states and 332 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:57:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:25,550 INFO L93 Difference]: Finished difference Result 449 states and 666 transitions. [2025-03-03 22:57:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:57:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2025-03-03 22:57:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:25,554 INFO L225 Difference]: With dead ends: 449 [2025-03-03 22:57:25,556 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 22:57:25,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:57:25,558 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 165 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:25,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 893 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:57:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 22:57:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2025-03-03 22:57:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 177 states have internal predecessors, (246), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 22:57:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 334 transitions. [2025-03-03 22:57:25,587 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 334 transitions. Word has length 139 [2025-03-03 22:57:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:25,588 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 334 transitions. [2025-03-03 22:57:25,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:57:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 334 transitions. [2025-03-03 22:57:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:57:25,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:25,591 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:57:25,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:25,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1409236470, now seen corresponding path program 1 times [2025-03-03 22:57:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680504713] [2025-03-03 22:57:25,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:25,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:57:25,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:57:25,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:57:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680504713] [2025-03-03 22:57:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680504713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168531901] [2025-03-03 22:57:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:26,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:26,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:26,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:57:26,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:57:26,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:57:26,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:26,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:26,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:57:26,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 393 proven. 24 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-03 22:57:26,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:57:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168531901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:57:26,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:57:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 22:57:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622858974] [2025-03-03 22:57:26,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:26,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:57:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:26,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:57:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:57:26,559 INFO L87 Difference]: Start difference. First operand 226 states and 334 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:57:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:26,829 INFO L93 Difference]: Finished difference Result 370 states and 543 transitions. [2025-03-03 22:57:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:57:26,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 140 [2025-03-03 22:57:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:26,831 INFO L225 Difference]: With dead ends: 370 [2025-03-03 22:57:26,831 INFO L226 Difference]: Without dead ends: 147 [2025-03-03 22:57:26,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:57:26,832 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 320 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:26,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 230 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:57:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-03 22:57:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 127. [2025-03-03 22:57:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.316326530612245) internal successors, (129), 99 states have internal predecessors, (129), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:57:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2025-03-03 22:57:26,851 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 140 [2025-03-03 22:57:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:26,851 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2025-03-03 22:57:26,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:57:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2025-03-03 22:57:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:57:26,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:26,853 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:26,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:57:27,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:27,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:27,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash -475044386, now seen corresponding path program 1 times [2025-03-03 22:57:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229928196] [2025-03-03 22:57:27,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:27,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:57:27,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:57:27,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:27,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:57:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200393621] [2025-03-03 22:57:27,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:27,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:27,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:27,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:27,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:57:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:57:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:57:27,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:27,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 22:57:27,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 404 proven. 78 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-03 22:57:28,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-03 22:57:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229928196] [2025-03-03 22:57:30,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:57:30,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200393621] [2025-03-03 22:57:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200393621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:57:30,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:57:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2025-03-03 22:57:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77629817] [2025-03-03 22:57:30,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:30,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 22:57:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:30,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 22:57:30,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2025-03-03 22:57:30,558 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 10 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2025-03-03 22:57:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:37,139 INFO L93 Difference]: Finished difference Result 755 states and 1028 transitions. [2025-03-03 22:57:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-03 22:57:37,139 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 10 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) Word has length 141 [2025-03-03 22:57:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:37,142 INFO L225 Difference]: With dead ends: 755 [2025-03-03 22:57:37,144 INFO L226 Difference]: Without dead ends: 631 [2025-03-03 22:57:37,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1672, Invalid=4970, Unknown=0, NotChecked=0, Total=6642 [2025-03-03 22:57:37,149 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 2605 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:37,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2608 Valid, 1064 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 22:57:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-03 22:57:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 391. [2025-03-03 22:57:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 307 states have (on average 1.3029315960912051) internal successors, (400), 309 states have internal predecessors, (400), 66 states have call successors, (66), 17 states have call predecessors, (66), 17 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 22:57:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 532 transitions. [2025-03-03 22:57:37,200 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 532 transitions. Word has length 141 [2025-03-03 22:57:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:37,201 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 532 transitions. [2025-03-03 22:57:37,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 30 states have internal predecessors, (96), 10 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2025-03-03 22:57:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 532 transitions. [2025-03-03 22:57:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:57:37,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:37,202 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:37,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:57:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:37,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -980603011, now seen corresponding path program 1 times [2025-03-03 22:57:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105257264] [2025-03-03 22:57:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:37,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:57:37,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:57:37,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:37,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:57:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639866929] [2025-03-03 22:57:37,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:37,543 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-03 22:57:37,545 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-03 22:57:37,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:57:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:57:37,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:37,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:37,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 22:57:37,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 464 proven. 54 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:57:38,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:45,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~last_1_var_1_10~0 65536)) (.cse0 (* c_~last_1_var_1_29~0 c_~last_1_var_1_1~0))) (let ((.cse4 (div .cse0 c_~var_1_4~0)) (.cse1 (+ .cse6 1))) (let ((.cse2 (= (mod .cse0 c_~var_1_4~0) 0)) (.cse5 (< c_~var_1_4~0 0)) (.cse3 (< .cse4 .cse1))) (and (forall ((~var_1_23~0 Int)) (or (< (div .cse0 ~var_1_23~0) .cse1) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (< ~var_1_23~0 0))) (or (not .cse2) .cse3) (or (and (<= .cse4 .cse1) (or .cse5 (< .cse4 .cse6))) (< 0 (+ .cse0 1)) .cse2) (forall ((~var_1_23~0 Int)) (or (< (div .cse0 ~var_1_23~0) (+ 2 .cse6)) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0))) (or .cse5 .cse3) (forall ((~var_1_23~0 Int)) (or (< (div .cse0 ~var_1_23~0) .cse1) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (not (= (mod .cse0 ~var_1_23~0) 0)))))))) is different from false [2025-03-03 22:57:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:57:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105257264] [2025-03-03 22:57:45,387 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:57:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639866929] [2025-03-03 22:57:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639866929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:45,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:57:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-03 22:57:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912478051] [2025-03-03 22:57:45,388 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:45,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:57:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:57:45,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:57:45,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=227, Unknown=1, NotChecked=30, Total=306 [2025-03-03 22:57:45,389 INFO L87 Difference]: Start difference. First operand 391 states and 532 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 22:57:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:47,043 INFO L93 Difference]: Finished difference Result 670 states and 905 transitions. [2025-03-03 22:57:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 22:57:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 141 [2025-03-03 22:57:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:47,046 INFO L225 Difference]: With dead ends: 670 [2025-03-03 22:57:47,048 INFO L226 Difference]: Without dead ends: 420 [2025-03-03 22:57:47,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=196, Invalid=737, Unknown=1, NotChecked=58, Total=992 [2025-03-03 22:57:47,049 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 243 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:47,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 827 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 22:57:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-03 22:57:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 395. [2025-03-03 22:57:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 310 states have (on average 1.2967741935483872) internal successors, (402), 312 states have internal predecessors, (402), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 22:57:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 534 transitions. [2025-03-03 22:57:47,098 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 534 transitions. Word has length 141 [2025-03-03 22:57:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:47,098 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 534 transitions. [2025-03-03 22:57:47,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 22:57:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 534 transitions. [2025-03-03 22:57:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:57:47,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:47,099 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:57:47,107 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-03 22:57:47,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:47,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:47,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1742713567, now seen corresponding path program 1 times [2025-03-03 22:57:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:57:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655840706] [2025-03-03 22:57:47,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:57:47,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:57:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:57:47,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:57:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086908775] [2025-03-03 22:57:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:47,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:57:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:57:47,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:57:47,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 22:57:47,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:57:47,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:57:47,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:47,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:47,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 22:57:47,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 520 proven. 114 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 22:57:49,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:58:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:58:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655840706] [2025-03-03 22:58:07,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:58:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086908775] [2025-03-03 22:58:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086908775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:58:07,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:58:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-03 22:58:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670668739] [2025-03-03 22:58:07,145 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:58:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 22:58:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:58:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 22:58:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=512, Unknown=3, NotChecked=0, Total=650 [2025-03-03 22:58:07,146 INFO L87 Difference]: Start difference. First operand 395 states and 534 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 6 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-03 22:58:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:12,026 INFO L93 Difference]: Finished difference Result 877 states and 1160 transitions. [2025-03-03 22:58:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 22:58:12,028 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 6 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 141 [2025-03-03 22:58:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:12,032 INFO L225 Difference]: With dead ends: 877 [2025-03-03 22:58:12,032 INFO L226 Difference]: Without dead ends: 702 [2025-03-03 22:58:12,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=679, Invalid=2510, Unknown=3, NotChecked=0, Total=3192 [2025-03-03 22:58:12,034 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 579 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:12,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 484 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 22:58:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-03 22:58:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 475. [2025-03-03 22:58:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 376 states have (on average 1.2686170212765957) internal successors, (477), 379 states have internal predecessors, (477), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 22:58:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 617 transitions. [2025-03-03 22:58:12,112 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 617 transitions. Word has length 141 [2025-03-03 22:58:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:12,112 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 617 transitions. [2025-03-03 22:58:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 6 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-03 22:58:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 617 transitions. [2025-03-03 22:58:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:58:12,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:12,114 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:58:12,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 22:58:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:12,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1237154942, now seen corresponding path program 1 times [2025-03-03 22:58:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733628474] [2025-03-03 22:58:12,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:58:12,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:58:12,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:12,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:58:12,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457376333] [2025-03-03 22:58:12,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:12,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:12,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:58:12,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 22:58:12,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:58:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:58:12,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:12,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:12,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 22:58:12,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 502 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 22:58:14,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:58:22,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~last_1_var_1_10~0 65536))) (let ((.cse2 (div c_~var_1_5~0 c_~var_1_4~0)) (.cse0 (+ .cse3 1))) (let ((.cse4 (= (mod c_~var_1_5~0 c_~var_1_4~0) 0)) (.cse5 (< .cse2 .cse0)) (.cse1 (< 0 (+ c_~var_1_5~0 1)))) (and (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (not (= (mod c_~var_1_5~0 ~var_1_23~0) 0)) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0))) (or .cse1 (and (or (< c_~var_1_4~0 0) (< .cse2 .cse3)) (<= .cse2 .cse0)) .cse4) (or (not .cse4) .cse5) (or (< c_~var_1_5~0 0) .cse5) (or (forall ((~var_1_23~0 Int)) (or (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (= (mod c_~var_1_5~0 ~var_1_23~0) 0) (< (div c_~var_1_5~0 ~var_1_23~0) (+ 2 .cse3)))) .cse1) (forall ((~var_1_23~0 Int)) (or (< (div c_~var_1_5~0 ~var_1_23~0) .cse0) (< c_~var_1_4~0 ~var_1_23~0) (= ~var_1_23~0 0) (< ~var_1_23~0 0))))))) is different from false [2025-03-03 22:58:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:58:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733628474] [2025-03-03 22:58:22,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:58:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457376333] [2025-03-03 22:58:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457376333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:58:22,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:58:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-03 22:58:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232967577] [2025-03-03 22:58:22,692 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:58:22,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 22:58:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:58:22,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 22:58:22,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=264, Unknown=1, NotChecked=34, Total=380 [2025-03-03 22:58:22,694 INFO L87 Difference]: Start difference. First operand 475 states and 617 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-03 22:58:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:24,416 INFO L93 Difference]: Finished difference Result 728 states and 948 transitions. [2025-03-03 22:58:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:58:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 141 [2025-03-03 22:58:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:24,421 INFO L225 Difference]: With dead ends: 728 [2025-03-03 22:58:24,421 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 22:58:24,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=310, Invalid=953, Unknown=1, NotChecked=68, Total=1332 [2025-03-03 22:58:24,422 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 167 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:24,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 637 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 22:58:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 22:58:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 475. [2025-03-03 22:58:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 376 states have (on average 1.2659574468085106) internal successors, (476), 379 states have internal predecessors, (476), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 22:58:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 616 transitions. [2025-03-03 22:58:24,481 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 616 transitions. Word has length 141 [2025-03-03 22:58:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 616 transitions. [2025-03-03 22:58:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-03 22:58:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 616 transitions. [2025-03-03 22:58:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:58:24,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:24,483 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:58:24,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 22:58:24,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:24,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 156637126, now seen corresponding path program 1 times [2025-03-03 22:58:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843239436] [2025-03-03 22:58:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:24,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:24,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:24,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:24,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:58:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540315859] [2025-03-03 22:58:24,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:24,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:24,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:24,846 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:58:24,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 22:58:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:24,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:58:24,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:58:24,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:58:25,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:58:25,062 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:58:25,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:58:25,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 22:58:25,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:25,272 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:58:25,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:58:25,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:58:25 BoogieIcfgContainer [2025-03-03 22:58:25,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:58:25,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:58:25,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:58:25,344 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:58:25,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:22" (3/4) ... [2025-03-03 22:58:25,345 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:58:25,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:58:25,347 INFO L158 Benchmark]: Toolchain (without parser) took 63936.88ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 111.6MB in the beginning and 233.1MB in the end (delta: -121.5MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. [2025-03-03 22:58:25,347 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:58:25,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.65ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 95.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:58:25,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.42ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 91.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:58:25,347 INFO L158 Benchmark]: Boogie Preprocessor took 37.62ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 86.6MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:58:25,348 INFO L158 Benchmark]: IcfgBuilder took 482.31ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 55.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 22:58:25,348 INFO L158 Benchmark]: TraceAbstraction took 63118.40ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 55.0MB in the beginning and 233.1MB in the end (delta: -178.1MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. [2025-03-03 22:58:25,348 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 520.1MB. Free memory is still 233.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:58:25,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.65ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 95.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.42ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 91.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.62ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 86.6MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 482.31ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 55.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63118.40ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 55.0MB in the beginning and 233.1MB in the end (delta: -178.1MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 520.1MB. Free memory is still 233.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 75, overapproximation of someUnaryFLOAToperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 10; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 5; [L27] double var_1_7 = 4.175; [L28] unsigned char var_1_9 = 100; [L29] unsigned short int var_1_10 = 128; [L30] float var_1_11 = 10.6; [L31] float var_1_12 = 16.25; [L32] float var_1_13 = 0.0; [L33] float var_1_14 = 127.2; [L34] double var_1_15 = 0.75; [L35] unsigned char var_1_18 = 1; [L36] unsigned char var_1_19 = 1; [L37] signed char var_1_20 = 1; [L38] signed short int var_1_21 = -1; [L39] unsigned long int var_1_22 = 1000000000; [L40] signed long int var_1_23 = -50; [L41] unsigned long int var_1_24 = 3900988395; [L42] unsigned long int var_1_25 = 2230016845; [L43] unsigned long int var_1_26 = 256; [L44] unsigned long int var_1_27 = 4; [L45] signed char var_1_29 = 8; [L46] signed long int last_1_var_1_1 = 2; [L47] unsigned char last_1_var_1_9 = 100; [L48] unsigned short int last_1_var_1_10 = 128; [L49] double last_1_var_1_15 = 0.75; [L50] signed short int last_1_var_1_21 = -1; [L51] unsigned long int last_1_var_1_22 = 1000000000; [L52] unsigned long int last_1_var_1_27 = 4; [L53] signed char last_1_var_1_29 = 8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L173] last_1_var_1_1 = var_1_1 [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_10 = var_1_10 [L176] last_1_var_1_15 = var_1_15 [L177] last_1_var_1_21 = var_1_21 [L178] last_1_var_1_22 = var_1_22 [L179] last_1_var_1_27 = var_1_27 [L180] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=0, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L190] RET updateLastVariables() [L191] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=10, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L143] var_1_3 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L144] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=64, var_1_5=5, var_1_7=167/40, var_1_9=100] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L147] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=5, var_1_7=167/40, var_1_9=100] [L149] var_1_5 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L151] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_12=65/4, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L152] var_1_12 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L153] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_13=0, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L154] var_1_13 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L155] RET assume_abort_if_not((var_1_13 >= 6917529.027641073700e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_14=636/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L156] var_1_14 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L157] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=-50, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L161] var_1_23 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L162] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L163] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L164] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=3900988395, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L165] var_1_24 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_24 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L166] RET assume_abort_if_not(var_1_24 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L167] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=2230016845, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L168] var_1_25 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_25 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L169] RET assume_abort_if_not(var_1_25 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L170] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L191] RET updateVariables() [L192] CALL step() [L57] signed long int stepLocal_3 = last_1_var_1_1 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_3=16, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-1, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L58] COND TRUE var_1_5 == stepLocal_3 [L59] var_1_21 = ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L63] signed long int stepLocal_4 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_4=128, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L64] COND TRUE (var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= stepLocal_4 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=1000000000, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L65] COND TRUE \read(var_1_19) [L66] var_1_22 = (var_1_24 - (last_1_var_1_9 + var_1_4)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L71] COND TRUE last_1_var_1_15 < (- var_1_14) [L72] var_1_18 = (var_1_2 || var_1_19) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=128, var_1_11=53/5, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L74] var_1_10 = ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) [L75] var_1_11 = (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13)))) [L76] var_1_20 = var_1_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=100] [L77] COND TRUE var_1_21 != 10 [L78] var_1_9 = ((((var_1_4) > (2)) ? (var_1_4) : (2))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L90] signed short int stepLocal_2 = var_1_21; [L91] unsigned long int stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, stepLocal_2=-13763, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L92] COND FALSE !((var_1_9 * (var_1_4 * var_1_5)) < stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_15=3/4, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L99] COND TRUE \read(var_1_18) [L100] var_1_15 = ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L112] signed long int stepLocal_0 = 500 * var_1_10; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L113] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_0=8000, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L114] COND FALSE !((var_1_3 - (var_1_4 - var_1_5)) >= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=4, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L120] COND TRUE var_1_18 && var_1_19 [L121] var_1_27 = ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=256, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L123] COND TRUE (var_1_13 - var_1_14) <= var_1_12 [L124] var_1_26 = (var_1_25 - var_1_27) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L128] unsigned char stepLocal_5 = var_1_13 < var_1_15; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, stepLocal_5=1, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L129] COND TRUE var_1_18 || stepLocal_5 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=8, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L130] COND TRUE (((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15 [L131] var_1_29 = (var_1_5 - 10) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, stepLocal_1=2147483484, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L183] EXPR ((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L183] EXPR (var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L183-L184] return ((((((((((((var_1_18 ? (((var_1_3 - (var_1_4 - var_1_5)) >= (500 * var_1_10)) ? (var_1_1 == ((signed long int) var_1_4)) : 1) : (var_1_1 == ((signed long int) var_1_4))) && (((var_1_9 * (var_1_4 * var_1_5)) < var_1_21) ? ((var_1_22 != (var_1_5 | (var_1_9 ^ var_1_4))) ? (var_1_18 ? (var_1_7 == ((double) 8.5)) : 1) : 1) : 1)) && ((var_1_21 != 10) ? (var_1_9 == ((unsigned char) ((((var_1_4) > (2)) ? (var_1_4) : (2))))) : ((var_1_22 > (var_1_21 / 128)) ? (var_1_18 ? (var_1_9 == ((unsigned char) var_1_4)) : (var_1_9 == ((unsigned char) var_1_5))) : (var_1_9 == ((unsigned char) var_1_4))))) && (var_1_10 == ((unsigned short int) ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4)))))) && (var_1_11 == ((float) (var_1_12 - ((((var_1_14) < (var_1_13)) ? (var_1_14) : (var_1_13))))))) && (var_1_18 ? (var_1_15 == ((double) ((((((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (((((var_1_14) > (var_1_12)) ? (var_1_14) : (var_1_12)))) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : ((var_1_22 < var_1_4) ? ((var_1_18 || var_1_18) ? (var_1_15 == ((double) var_1_14)) : (var_1_15 == ((double) var_1_14))) : (var_1_15 == ((double) var_1_13))))) && ((last_1_var_1_15 < (- var_1_14)) ? (var_1_18 == ((unsigned char) (var_1_2 || var_1_19))) : 1)) && (var_1_20 == ((signed char) var_1_5))) && ((var_1_5 == (last_1_var_1_1 * last_1_var_1_29)) ? (var_1_21 == ((signed short int) ((var_1_4 - last_1_var_1_1) + ((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22)))))) : (var_1_21 == ((signed short int) ((((last_1_var_1_21) > (var_1_4)) ? (last_1_var_1_21) : (var_1_4))))))) && (((var_1_5 / ((((var_1_4) < (var_1_23)) ? (var_1_4) : (var_1_23)))) <= last_1_var_1_10) ? (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_24 - (last_1_var_1_9 + var_1_4)))) : (var_1_22 == ((unsigned long int) (((((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) < (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))) ? ((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) - (last_1_var_1_9 + last_1_var_1_27))) : (((((last_1_var_1_10) > (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (last_1_var_1_10) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))))))))))) : 1)) && (((var_1_13 - var_1_14) <= var_1_12) ? (var_1_26 == ((unsigned long int) (var_1_25 - var_1_27))) : (var_1_26 == ((unsigned long int) ((((var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) < 0 ) ? -(var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))) : (var_1_27 + ((((var_1_9) > (var_1_5)) ? (var_1_9) : (var_1_5)))))))))) && ((var_1_18 && var_1_19) ? (var_1_27 == ((unsigned long int) ((((var_1_5) < (((var_1_4 + var_1_1) + var_1_1))) ? (var_1_5) : (((var_1_4 + var_1_1) + var_1_1)))))) : 1)) && ((var_1_18 || (var_1_13 < var_1_15)) ? (((((((var_1_7 / var_1_13)) > (99.6f)) ? ((var_1_7 / var_1_13)) : (99.6f))) != var_1_15) ? (var_1_29 == ((signed char) (var_1_5 - 10))) : (var_1_29 == ((signed char) var_1_5))) : (var_1_29 == ((signed char) var_1_5))) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_15=3/4, last_1_var_1_1=2, last_1_var_1_21=-1, last_1_var_1_22=1000000000, last_1_var_1_27=4, last_1_var_1_29=8, last_1_var_1_9=100, var_1_10=16, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=2, var_1_18=1, var_1_19=1, var_1_1=2, var_1_20=16, var_1_21=-13763, var_1_22=2147483484, var_1_23=5, var_1_24=2147483647, var_1_25=-2147483649, var_1_26=-2147483665, var_1_27=16, var_1_29=6, var_1_2=-255, var_1_3=-1, var_1_4=63, var_1_5=16, var_1_7=167/40, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.0s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4400 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4392 mSDsluCounter, 5673 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4579 mSDsCounter, 946 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5367 IncrementalHoareTripleChecker+Invalid, 6313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 946 mSolverCounterUnsat, 1094 mSDtfsCounter, 5367 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1434 GetRequests, 1203 SyntacticMatches, 1 SemanticMatches, 230 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3503 ImplicationChecksByTransitivity, 32.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=8, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1800 ConstructedInterpolants, 9 QuantifiedInterpolants, 10301 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2189 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 9329/9880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:58:25,563 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 22:58:25,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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-37.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 82983888234bfc7ff4512a899a5dc395d77164a6c3d94b0d7f8ec44d066bed1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:58:27,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:58:27,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:58:27,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:58:27,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:58:27,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:58:27,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:58:27,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:58:27,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:58:27,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:58:27,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:58:27,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:58:27,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:58:27,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:58:27,256 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:58:27,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:58:27,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:58:27,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:58:27,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:58:27,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:58:27,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:58:27,260 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 -> 82983888234bfc7ff4512a899a5dc395d77164a6c3d94b0d7f8ec44d066bed1e [2025-03-03 22:58:27,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:58:27,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:58:27,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:58:27,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:58:27,497 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:58:27,500 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-37.i [2025-03-03 22:58:28,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b67ef97/29a7675f9d8245119f9be3647401a13e/FLAG4355627d4 [2025-03-03 22:58:28,822 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:58:28,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-37.i [2025-03-03 22:58:28,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b67ef97/29a7675f9d8245119f9be3647401a13e/FLAG4355627d4 [2025-03-03 22:58:29,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b67ef97/29a7675f9d8245119f9be3647401a13e [2025-03-03 22:58:29,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:58:29,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:58:29,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:58:29,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:58:29,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:58:29,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c72f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29, skipping insertion in model container [2025-03-03 22:58:29,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:58:29,307 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-37.i[916,929] [2025-03-03 22:58:29,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:58:29,375 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:58:29,382 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-37.i[916,929] [2025-03-03 22:58:29,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:58:29,425 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:58:29,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29 WrapperNode [2025-03-03 22:58:29,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:58:29,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:58:29,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:58:29,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:58:29,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,460 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2025-03-03 22:58:29,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:58:29,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:58:29,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:58:29,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:58:29,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:58:29,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:58:29,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:58:29,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:58:29,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:58:29,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (1/1) ... [2025-03-03 22:58:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:58:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:29,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:58:29,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:58:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:58:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:58:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:58:29,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:58:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:58:29,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:58:29,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:58:29,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:58:43,762 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 22:58:43,763 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:58:43,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:58:43,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:58:43,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:43 BoogieIcfgContainer [2025-03-03 22:58:43,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:58:43,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:58:43,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:58:43,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:58:43,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:58:29" (1/3) ... [2025-03-03 22:58:43,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d98b53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:43, skipping insertion in model container [2025-03-03 22:58:43,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:29" (2/3) ... [2025-03-03 22:58:43,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d98b53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:43, skipping insertion in model container [2025-03-03 22:58:43,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:43" (3/3) ... [2025-03-03 22:58:43,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-37.i [2025-03-03 22:58:43,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:58:43,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-37.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:58:43,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:58:43,829 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;@c393b7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:58:43,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:58:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:58:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 22:58:43,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:43,840 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:58:43,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 476994014, now seen corresponding path program 1 times [2025-03-03 22:58:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:58:43,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927715350] [2025-03-03 22:58:43,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:43,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:58:43,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:58:43,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:58:43,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:58:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 22:58:44,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 22:58:44,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:44,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:44,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:58:44,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-03-03 22:58:44,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:58:44,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:58:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927715350] [2025-03-03 22:58:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927715350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:58:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:58:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:58:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603108196] [2025-03-03 22:58:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:58:44,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:58:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:58:44,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:58:44,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:58:44,767 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:58:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:44,789 INFO L93 Difference]: Finished difference Result 140 states and 241 transitions. [2025-03-03 22:58:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:58:44,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 135 [2025-03-03 22:58:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:44,797 INFO L225 Difference]: With dead ends: 140 [2025-03-03 22:58:44,798 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 22:58:44,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:58:44,803 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:44,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:58:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 22:58:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 22:58:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:58:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2025-03-03 22:58:44,841 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 135 [2025-03-03 22:58:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:44,842 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2025-03-03 22:58:44,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:58:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2025-03-03 22:58:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 22:58:44,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:44,847 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:58:44,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:58:45,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:58:45,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:45,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1530115780, now seen corresponding path program 1 times [2025-03-03 22:58:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:58:45,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616898610] [2025-03-03 22:58:45,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:58:45,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:58:45,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:58:45,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:58:45,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 22:58:45,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 22:58:45,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:45,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:45,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:58:45,899 INFO L279 TraceCheckSpWp]: Computing forward predicates...