./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.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 fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:12:02,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:12:02,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:12:02,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:12:02,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:12:02,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:12:02,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:12:02,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:12:02,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:12:02,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:12:02,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:12:02,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:12:02,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:12:02,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:12:02,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:12:02,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:12:02,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:12:02,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:12:02,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:12:02,340 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 -> fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 [2025-03-08 11:12:02,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:12:02,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:12:02,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:12:02,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:12:02,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:12:02,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2025-03-08 11:12:03,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f147cca2/384e85eced924b2caa14acec3510e5e9/FLAGbdf72b4fc [2025-03-08 11:12:03,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:12:03,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2025-03-08 11:12:03,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f147cca2/384e85eced924b2caa14acec3510e5e9/FLAGbdf72b4fc [2025-03-08 11:12:04,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f147cca2/384e85eced924b2caa14acec3510e5e9 [2025-03-08 11:12:04,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:12:04,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:12:04,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:12:04,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:12:04,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:12:04,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04, skipping insertion in model container [2025-03-08 11:12:04,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:12:04,384 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2025-03-08 11:12:04,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:12:04,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:12:04,469 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2025-03-08 11:12:04,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:12:04,523 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:12:04,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04 WrapperNode [2025-03-08 11:12:04,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:12:04,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:12:04,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:12:04,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:12:04,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,579 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-08 11:12:04,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:12:04,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:12:04,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:12:04,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:12:04,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:12:04,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:12:04,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:12:04,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:12:04,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:12:04,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (1/1) ... [2025-03-08 11:12:04,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:12:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:12:04,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:12:04,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:12:04,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:12:04,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:12:04,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:12:04,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:12:04,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:12:04,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:12:04,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:12:04,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:12:05,027 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc property_#t~bitwise18#1; [2025-03-08 11:12:05,056 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-08 11:12:05,056 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:12:05,077 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:12:05,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:12:05,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:05 BoogieIcfgContainer [2025-03-08 11:12:05,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:12:05,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:12:05,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:12:05,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:12:05,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:12:04" (1/3) ... [2025-03-08 11:12:05,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70549b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:12:05, skipping insertion in model container [2025-03-08 11:12:05,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:04" (2/3) ... [2025-03-08 11:12:05,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70549b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:12:05, skipping insertion in model container [2025-03-08 11:12:05,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:05" (3/3) ... [2025-03-08 11:12:05,087 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2025-03-08 11:12:05,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:12:05,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:12:05,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:12:05,166 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;@2bb96efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:12:05,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:12:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 11:12:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 11:12:05,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:05,183 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:05,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:05,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:05,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1256294672, now seen corresponding path program 1 times [2025-03-08 11:12:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:12:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389797981] [2025-03-08 11:12:05,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:12:05,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 11:12:05,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 11:12:05,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:05,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 11:12:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:12:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389797981] [2025-03-08 11:12:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389797981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:12:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429085961] [2025-03-08 11:12:05,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:12:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:12:05,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:12:05,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:12:05,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 11:12:05,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 11:12:05,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:05,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:05,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:12:05,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 11:12:05,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:12:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429085961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:05,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:12:05,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:12:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276749282] [2025-03-08 11:12:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:05,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:12:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:12:05,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:12:05,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:12:05,680 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 11:12:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:05,703 INFO L93 Difference]: Finished difference Result 162 states and 277 transitions. [2025-03-08 11:12:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:12:05,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-03-08 11:12:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:05,709 INFO L225 Difference]: With dead ends: 162 [2025-03-08 11:12:05,709 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 11:12:05,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:12:05,716 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:05,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:12:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 11:12:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 11:12:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 11:12:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-08 11:12:05,760 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 161 [2025-03-08 11:12:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:05,761 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-08 11:12:05,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 11:12:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-08 11:12:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 11:12:05,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:05,765 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:05,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:12:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:12:05,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:05,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -987850512, now seen corresponding path program 1 times [2025-03-08 11:12:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:12:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934424596] [2025-03-08 11:12:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:12:05,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 11:12:06,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 11:12:06,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:06,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 11:12:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:12:06,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934424596] [2025-03-08 11:12:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934424596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:12:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:12:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367269339] [2025-03-08 11:12:06,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:06,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:12:06,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:12:06,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:12:06,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:12:06,317 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:06,441 INFO L93 Difference]: Finished difference Result 157 states and 239 transitions. [2025-03-08 11:12:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:12:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-08 11:12:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:06,443 INFO L225 Difference]: With dead ends: 157 [2025-03-08 11:12:06,443 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 11:12:06,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:12:06,445 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 113 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:06,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:12:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 11:12:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 11:12:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 11:12:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2025-03-08 11:12:06,475 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 161 [2025-03-08 11:12:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:06,477 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2025-03-08 11:12:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2025-03-08 11:12:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 11:12:06,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:06,479 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:06,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:12:06,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1362558422, now seen corresponding path program 1 times [2025-03-08 11:12:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:12:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49179184] [2025-03-08 11:12:06,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:12:06,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 11:12:06,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 11:12:06,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 11:12:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:12:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49179184] [2025-03-08 11:12:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49179184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:07,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:12:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:12:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457852731] [2025-03-08 11:12:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:07,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:12:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:12:07,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:12:07,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:12:07,211 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:07,655 INFO L93 Difference]: Finished difference Result 284 states and 422 transitions. [2025-03-08 11:12:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:12:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 11:12:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:07,657 INFO L225 Difference]: With dead ends: 284 [2025-03-08 11:12:07,657 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 11:12:07,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:12:07,658 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 186 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:07,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 502 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:12:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 11:12:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. [2025-03-08 11:12:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 11:12:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2025-03-08 11:12:07,693 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 162 [2025-03-08 11:12:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:07,693 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2025-03-08 11:12:07,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2025-03-08 11:12:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 11:12:07,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:07,695 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:07,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:12:07,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:07,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash 259566157, now seen corresponding path program 1 times [2025-03-08 11:12:07,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:12:07,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948256431] [2025-03-08 11:12:07,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:07,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:12:07,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 11:12:07,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 11:12:07,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:07,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 11:12:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:12:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948256431] [2025-03-08 11:12:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948256431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:12:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:12:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265885820] [2025-03-08 11:12:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:12:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:12:08,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:12:08,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:12:08,266 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:08,748 INFO L93 Difference]: Finished difference Result 303 states and 444 transitions. [2025-03-08 11:12:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:12:08,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2025-03-08 11:12:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:08,752 INFO L225 Difference]: With dead ends: 303 [2025-03-08 11:12:08,754 INFO L226 Difference]: Without dead ends: 226 [2025-03-08 11:12:08,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:12:08,755 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 226 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:08,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 543 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:12:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-08 11:12:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 154. [2025-03-08 11:12:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 11:12:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2025-03-08 11:12:08,780 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 163 [2025-03-08 11:12:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:08,781 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2025-03-08 11:12:08,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2025-03-08 11:12:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 11:12:08,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:08,782 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:08,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:12:08,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:08,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:08,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1612875854, now seen corresponding path program 1 times [2025-03-08 11:12:08,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:12:08,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843967207] [2025-03-08 11:12:08,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:12:08,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 11:12:08,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 11:12:08,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:08,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-03-08 11:12:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:12:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843967207] [2025-03-08 11:12:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843967207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:12:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053009511] [2025-03-08 11:12:09,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:12:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:12:09,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:12:09,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:12:09,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 11:12:09,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 11:12:09,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:09,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:09,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 11:12:09,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 689 proven. 57 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-08 11:12:09,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:12:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 60 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-08 11:12:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053009511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:12:09,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:12:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-08 11:12:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722160521] [2025-03-08 11:12:09,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:12:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:12:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:12:09,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:12:09,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:12:09,990 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-08 11:12:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:10,383 INFO L93 Difference]: Finished difference Result 290 states and 410 transitions. [2025-03-08 11:12:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:12:10,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 163 [2025-03-08 11:12:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:10,386 INFO L225 Difference]: With dead ends: 290 [2025-03-08 11:12:10,386 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 11:12:10,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 319 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2025-03-08 11:12:10,387 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:10,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 356 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:12:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 11:12:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2025-03-08 11:12:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 117 states have internal predecessors, (146), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 11:12:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 242 transitions. [2025-03-08 11:12:10,405 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 242 transitions. Word has length 163 [2025-03-08 11:12:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 242 transitions. [2025-03-08 11:12:10,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-08 11:12:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 242 transitions. [2025-03-08 11:12:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 11:12:10,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:10,408 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:10,416 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-08 11:12:10,608 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-08 11:12:10,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:10,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash -152265658, now seen corresponding path program 1 times [2025-03-08 11:12:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:12:10,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-03-08 11:12:10,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:10,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:12:10,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 11:12:10,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 11:12:10,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:10,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:12:10,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1484412131] [2025-03-08 11:12:10,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:10,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:12:10,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:12:10,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:12:10,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:12:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 11:12:10,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 11:12:10,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:10,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:12:10,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:12:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 11:12:10,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 11:12:10,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:10,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:12:10,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:12:10,904 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:12:10,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:12:10,913 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-08 11:12:11,107 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-08 11:12:11,110 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 11:12:11,230 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:12:11,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:12:11 BoogieIcfgContainer [2025-03-08 11:12:11,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:12:11,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:12:11,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:12:11,234 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:12:11,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:05" (3/4) ... [2025-03-08 11:12:11,237 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:12:11,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:12:11,238 INFO L158 Benchmark]: Toolchain (without parser) took 6970.35ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.4MB in the beginning and 160.8MB in the end (delta: -38.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2025-03-08 11:12:11,238 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:12:11,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.61ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:12:11,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.43ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:12:11,239 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 99.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:12:11,239 INFO L158 Benchmark]: IcfgBuilder took 452.92ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 73.2MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 11:12:11,239 INFO L158 Benchmark]: TraceAbstraction took 6154.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 72.3MB in the beginning and 160.9MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:12:11,239 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 243.3MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:12:11,241 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.61ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.43ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 99.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 452.92ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 73.2MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6154.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 72.3MB in the beginning and 160.9MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 243.3MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 153. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned char var_1_20 = 0; [L39] double var_1_21 = 4.65; [L40] unsigned char var_1_22 = 0; [L41] double var_1_23 = 9999999999.1; [L42] double var_1_24 = 5.5; [L43] unsigned short int var_1_25 = 16; [L44] unsigned short int var_1_26 = 100; [L45] signed long int var_1_27 = 32; [L46] float var_1_28 = 1.95; [L47] unsigned char var_1_29 = 0; [L48] unsigned char var_1_30 = 0; [L49] unsigned long int var_1_31 = 0; [L50] double last_1_var_1_9 = 4.6; [L51] unsigned char last_1_var_1_12 = 100; [L52] unsigned char last_1_var_1_14 = 0; [L53] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_14 = var_1_14 [L167] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L125] var_1_5 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L126] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L127] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L127] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L128] var_1_7 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L129] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L130] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L130] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L131] var_1_8 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L133] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L133] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L134] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L134] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L135] var_1_10 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L136] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L137] var_1_13 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L140] var_1_18 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L143] var_1_19 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L146] var_1_20 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L149] var_1_22 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L152] var_1_23 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L153] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L154] var_1_24 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L155] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L158] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L158] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L160] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L161] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L161] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L178] RET updateVariables() [L179] CALL step() [L57] var_1_17 = (var_1_18 || (var_1_19 && var_1_20)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L58] COND FALSE !(! var_1_22) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L61] var_1_25 = var_1_26 [L62] var_1_27 = var_1_25 [L63] var_1_28 = var_1_23 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L64] COND FALSE !(var_1_18 || var_1_17) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L67] COND TRUE var_1_21 >= var_1_28 [L68] var_1_29 = (! var_1_30) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L73] COND TRUE var_1_19 && ((var_1_23 + var_1_28) >= var_1_21) [L74] var_1_31 = var_1_25 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L76] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L77] COND FALSE !(\read(last_1_var_1_14)) [L88] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L90] var_1_16 = last_1_var_1_12 [L91] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L92] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L93] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L94] COND FALSE !(stepLocal_5 >= var_1_16) [L97] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L100] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L101] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L101] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L102] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L106] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L107] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L108] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L111] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L112] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L115] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L116] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L117] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L119] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=23/5] [L120] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L121] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=3] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=3] [L170-L171] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=1, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-157, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 154 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1104 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 586 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 494 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 146 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1462 NumberOfCodeBlocks, 1462 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1289 ConstructedInterpolants, 0 QuantifiedInterpolants, 3366 SizeOfPredicates, 4 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 8612/8832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:12:11,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.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 fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:12:13,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:12:13,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:12:13,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:12:13,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:12:13,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:12:13,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:12:13,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:12:13,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:12:13,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:12:13,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:12:13,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:12:13,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:12:13,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:12:13,452 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:12:13,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:12:13,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:12:13,453 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:12:13,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:12:13,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:12:13,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:12:13,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:12:13,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:12:13,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:12:13,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:12:13,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:12:13,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:12:13,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:12:13,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:12:13,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:12:13,456 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 -> fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 [2025-03-08 11:12:13,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:12:13,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:12:13,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:12:13,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:12:13,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:12:13,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2025-03-08 11:12:14,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfda369a/cab1811496e6463b9c06b38f16858a1a/FLAG69be6d6ee [2025-03-08 11:12:15,193 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:12:15,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2025-03-08 11:12:15,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfda369a/cab1811496e6463b9c06b38f16858a1a/FLAG69be6d6ee [2025-03-08 11:12:15,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfda369a/cab1811496e6463b9c06b38f16858a1a [2025-03-08 11:12:15,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:12:15,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:12:15,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:12:15,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:12:15,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:12:15,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee49f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15, skipping insertion in model container [2025-03-08 11:12:15,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:12:15,668 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2025-03-08 11:12:15,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:12:15,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:12:15,738 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2025-03-08 11:12:15,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:12:15,777 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:12:15,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15 WrapperNode [2025-03-08 11:12:15,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:12:15,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:12:15,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:12:15,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:12:15,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,827 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2025-03-08 11:12:15,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:12:15,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:12:15,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:12:15,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:12:15,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:12:15,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:12:15,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:12:15,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:12:15,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:12:15,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (1/1) ... [2025-03-08 11:12:15,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:12:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:12:15,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:12:15,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:12:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:12:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:12:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:12:15,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:12:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:12:15,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:12:16,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:12:16,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:12:18,015 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 11:12:18,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:12:18,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:12:18,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:12:18,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:18 BoogieIcfgContainer [2025-03-08 11:12:18,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:12:18,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:12:18,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:12:18,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:12:18,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:12:15" (1/3) ... [2025-03-08 11:12:18,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac8f38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:12:18, skipping insertion in model container [2025-03-08 11:12:18,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:12:15" (2/3) ... [2025-03-08 11:12:18,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac8f38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:12:18, skipping insertion in model container [2025-03-08 11:12:18,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:12:18" (3/3) ... [2025-03-08 11:12:18,037 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2025-03-08 11:12:18,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:12:18,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:12:18,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:12:18,114 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;@78726c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:12:18,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:12:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 11:12:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 11:12:18,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:18,129 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:18,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash -743016998, now seen corresponding path program 1 times [2025-03-08 11:12:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:12:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106620406] [2025-03-08 11:12:18,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:12:18,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:12:18,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:12:18,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 11:12:18,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 11:12:18,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:18,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:18,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:12:18,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-08 11:12:18,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:12:18,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:12:18,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106620406] [2025-03-08 11:12:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106620406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:12:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:12:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123896108] [2025-03-08 11:12:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:18,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:12:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:12:18,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:12:18,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:12:18,616 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 11:12:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:18,642 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2025-03-08 11:12:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:12:18,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2025-03-08 11:12:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:18,649 INFO L225 Difference]: With dead ends: 146 [2025-03-08 11:12:18,649 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 11:12:18,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:12:18,655 INFO L435 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:18,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:12:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 11:12:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 11:12:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 11:12:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2025-03-08 11:12:18,700 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 158 [2025-03-08 11:12:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2025-03-08 11:12:18,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 11:12:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2025-03-08 11:12:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 11:12:18,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:18,704 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:18,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:12:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:18,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 913937370, now seen corresponding path program 1 times [2025-03-08 11:12:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:12:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105406768] [2025-03-08 11:12:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:18,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:18,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:12:18,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:12:18,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:12:18,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 11:12:19,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 11:12:19,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:19,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:19,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:12:19,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 689 proven. 57 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-08 11:12:19,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:12:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 60 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-08 11:12:20,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:12:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105406768] [2025-03-08 11:12:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105406768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:12:20,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:12:20,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-08 11:12:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220854007] [2025-03-08 11:12:20,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:12:20,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:12:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:12:20,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:12:20,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:12:20,236 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-08 11:12:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:21,072 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2025-03-08 11:12:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:12:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 158 [2025-03-08 11:12:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:21,076 INFO L225 Difference]: With dead ends: 180 [2025-03-08 11:12:21,077 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 11:12:21,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=359, Unknown=0, NotChecked=0, Total=552 [2025-03-08 11:12:21,078 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 160 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:21,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 243 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:12:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 11:12:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2025-03-08 11:12:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 63 states have internal predecessors, (76), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:12:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-08 11:12:21,102 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 158 [2025-03-08 11:12:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:21,103 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-08 11:12:21,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-08 11:12:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-08 11:12:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 11:12:21,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:21,106 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:21,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:12:21,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:21,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1622748882, now seen corresponding path program 1 times [2025-03-08 11:12:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:12:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529862505] [2025-03-08 11:12:21,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:21,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:12:21,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:12:21,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:12:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 11:12:21,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 11:12:21,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:21,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:21,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:12:21,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 11:12:21,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:12:21,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:12:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529862505] [2025-03-08 11:12:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529862505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:12:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:12:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925950789] [2025-03-08 11:12:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:21,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:12:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:12:21,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:12:21,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:12:21,970 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:23,744 INFO L93 Difference]: Finished difference Result 344 states and 482 transitions. [2025-03-08 11:12:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:12:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-03-08 11:12:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:23,755 INFO L225 Difference]: With dead ends: 344 [2025-03-08 11:12:23,756 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 11:12:23,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:12:23,757 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 247 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:23,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 556 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 11:12:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 11:12:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 149. [2025-03-08 11:12:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 11:12:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2025-03-08 11:12:23,781 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 159 [2025-03-08 11:12:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2025-03-08 11:12:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2025-03-08 11:12:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 11:12:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:23,783 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:23,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 11:12:23,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:23,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:23,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 875267055, now seen corresponding path program 1 times [2025-03-08 11:12:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:12:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508153656] [2025-03-08 11:12:23,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:23,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:23,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:12:23,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:12:23,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:12:24,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 11:12:24,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 11:12:24,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:24,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:24,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 11:12:24,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 11:12:24,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:12:24,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:12:24,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508153656] [2025-03-08 11:12:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508153656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:12:24,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:12:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:12:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349584866] [2025-03-08 11:12:24,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:12:24,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:12:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:12:24,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:12:24,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:12:24,342 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:24,740 INFO L93 Difference]: Finished difference Result 231 states and 325 transitions. [2025-03-08 11:12:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:12:24,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-03-08 11:12:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:24,749 INFO L225 Difference]: With dead ends: 231 [2025-03-08 11:12:24,749 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 11:12:24,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:12:24,750 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 103 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:24,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:12:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 11:12:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 11:12:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 11:12:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 209 transitions. [2025-03-08 11:12:24,780 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 209 transitions. Word has length 159 [2025-03-08 11:12:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:24,781 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 209 transitions. [2025-03-08 11:12:24,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 11:12:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 209 transitions. [2025-03-08 11:12:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 11:12:24,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:24,783 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:24,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 11:12:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:24,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash 735086549, now seen corresponding path program 1 times [2025-03-08 11:12:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:12:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536804558] [2025-03-08 11:12:24,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:12:24,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:12:24,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 11:12:25,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 11:12:25,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 11:12:25,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:25,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 11:12:25,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-08 11:12:25,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:12:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-08 11:12:25,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:12:25,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536804558] [2025-03-08 11:12:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536804558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:12:25,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:12:25,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 11:12:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194685964] [2025-03-08 11:12:25,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:12:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:12:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:12:25,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:12:25,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:12:25,782 INFO L87 Difference]: Start difference. First operand 149 states and 209 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 11:12:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:12:26,434 INFO L93 Difference]: Finished difference Result 257 states and 347 transitions. [2025-03-08 11:12:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:12:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 160 [2025-03-08 11:12:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:12:26,447 INFO L225 Difference]: With dead ends: 257 [2025-03-08 11:12:26,447 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 11:12:26,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:12:26,448 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:12:26,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 325 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:12:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 11:12:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2025-03-08 11:12:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 99 states have internal predecessors, (118), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 11:12:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 214 transitions. [2025-03-08 11:12:26,462 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 214 transitions. Word has length 160 [2025-03-08 11:12:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:12:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 214 transitions. [2025-03-08 11:12:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 11:12:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2025-03-08 11:12:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 11:12:26,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:12:26,464 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:12:26,476 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 (6)] Forceful destruction successful, exit code 0 [2025-03-08 11:12:26,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:26,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:12:26,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:12:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -152417132, now seen corresponding path program 1 times [2025-03-08 11:12:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:12:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39364855] [2025-03-08 11:12:26,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:26,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:12:26,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:12:26,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:12:26,670 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 (7)] Waiting until timeout for monitored process [2025-03-08 11:12:26,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 11:12:26,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 11:12:26,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:26,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:26,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 11:12:26,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:12:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 417 proven. 114 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-08 11:12:27,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:12:29,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:12:29,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39364855] [2025-03-08 11:12:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39364855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:12:29,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1730322335] [2025-03-08 11:12:29,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:12:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 11:12:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 11:12:29,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 11:12:29,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-08 11:12:29,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 11:12:30,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 11:12:30,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:12:30,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:12:30,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 11:12:30,303 INFO L279 TraceCheckSpWp]: Computing forward predicates...