/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 06:21:43,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 06:21:43,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 06:21:43,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 06:21:43,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 06:21:43,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 06:21:43,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 06:21:43,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 06:21:43,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 06:21:43,595 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 06:21:43,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 06:21:43,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 06:21:43,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 06:21:43,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 06:21:43,597 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 06:21:43,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 06:21:43,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 06:21:43,597 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 06:21:43,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 06:21:43,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 06:21:43,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 06:21:43,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 06:21:43,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 06:21:43,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 06:21:43,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 06:21:43,599 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 06:21:43,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 06:21:43,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 06:21:43,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 06:21:43,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 06:21:43,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 06:21:43,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 06:21:43,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 06:21:43,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 06:21:43,601 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 06:21:43,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 06:21:43,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 06:21:43,602 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 06:21:43,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 06:21:43,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 06:21:43,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 06:21:43,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 06:21:43,747 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 06:21:43,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound100.c [2023-12-21 06:21:44,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 06:21:44,881 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 06:21:44,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound100.c [2023-12-21 06:21:44,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8285825ec/276548a1a5314bbb82e633299d489e8f/FLAGaebb0a5bd [2023-12-21 06:21:45,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8285825ec/276548a1a5314bbb82e633299d489e8f [2023-12-21 06:21:45,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 06:21:45,307 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 06:21:45,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 06:21:45,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 06:21:45,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 06:21:45,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d442b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45, skipping insertion in model container [2023-12-21 06:21:45,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,329 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 06:21:45,422 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2023-12-21 06:21:45,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 06:21:45,453 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 06:21:45,461 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2023-12-21 06:21:45,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 06:21:45,479 INFO L206 MainTranslator]: Completed translation [2023-12-21 06:21:45,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45 WrapperNode [2023-12-21 06:21:45,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 06:21:45,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 06:21:45,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 06:21:45,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 06:21:45,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,501 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2023-12-21 06:21:45,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 06:21:45,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 06:21:45,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 06:21:45,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 06:21:45,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,517 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]. [2023-12-21 06:21:45,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 06:21:45,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 06:21:45,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 06:21:45,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 06:21:45,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (1/1) ... [2023-12-21 06:21:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 06:21:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:45,549 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) [2023-12-21 06:21:45,566 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 [2023-12-21 06:21:45,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 06:21:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 06:21:45,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 06:21:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 06:21:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 06:21:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 06:21:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 06:21:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 06:21:45,623 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 06:21:45,625 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 06:21:45,724 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 06:21:45,739 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 06:21:45,740 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 06:21:45,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:21:45 BoogieIcfgContainer [2023-12-21 06:21:45,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 06:21:45,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 06:21:45,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 06:21:45,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 06:21:45,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:21:45" (1/3) ... [2023-12-21 06:21:45,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e6aadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:21:45, skipping insertion in model container [2023-12-21 06:21:45,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:21:45" (2/3) ... [2023-12-21 06:21:45,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e6aadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:21:45, skipping insertion in model container [2023-12-21 06:21:45,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:21:45" (3/3) ... [2023-12-21 06:21:45,745 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound100.c [2023-12-21 06:21:45,756 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 06:21:45,756 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 06:21:45,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 06:21:45,794 INFO L357 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, mHoare=true, 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;@58e8886c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 06:21:45,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 06:21:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 06:21:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 06:21:45,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:45,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:45,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:45,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2138951705, now seen corresponding path program 1 times [2023-12-21 06:21:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625185040] [2023-12-21 06:21:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 06:21:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:45,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 06:21:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 06:21:45,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625185040] [2023-12-21 06:21:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625185040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:21:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:21:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 06:21:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345348833] [2023-12-21 06:21:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:21:45,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 06:21:45,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 06:21:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 06:21:45,934 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 06:21:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:45,962 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2023-12-21 06:21:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 06:21:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-21 06:21:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:45,968 INFO L225 Difference]: With dead ends: 52 [2023-12-21 06:21:45,969 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 06:21:45,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 06:21:45,973 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:45,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:21:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 06:21:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 06:21:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 06:21:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-12-21 06:21:46,003 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2023-12-21 06:21:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:46,003 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-12-21 06:21:46,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 06:21:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-12-21 06:21:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 06:21:46,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:46,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:46,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 06:21:46,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:46,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:46,005 INFO L85 PathProgramCache]: Analyzing trace with hash -443127421, now seen corresponding path program 1 times [2023-12-21 06:21:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541381573] [2023-12-21 06:21:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 06:21:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 06:21:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 06:21:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:46,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541381573] [2023-12-21 06:21:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541381573] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:21:46,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:21:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 06:21:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994325575] [2023-12-21 06:21:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:21:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 06:21:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 06:21:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 06:21:46,126 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 06:21:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:46,141 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-12-21 06:21:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 06:21:46,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-21 06:21:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:46,142 INFO L225 Difference]: With dead ends: 37 [2023-12-21 06:21:46,142 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 06:21:46,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 06:21:46,143 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:46,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:21:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 06:21:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 06:21:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 06:21:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-21 06:21:46,150 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2023-12-21 06:21:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:46,151 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-21 06:21:46,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 06:21:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-21 06:21:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 06:21:46,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:46,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:46,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 06:21:46,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:46,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash -441459125, now seen corresponding path program 1 times [2023-12-21 06:21:46,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951927330] [2023-12-21 06:21:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:46,164 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463559110] [2023-12-21 06:21:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:46,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:46,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:46,209 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) [2023-12-21 06:21:46,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 06:21:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:46,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 06:21:46,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 06:21:46,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 06:21:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951927330] [2023-12-21 06:21:46,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463559110] [2023-12-21 06:21:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463559110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:21:46,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:21:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 06:21:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018120842] [2023-12-21 06:21:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:21:46,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 06:21:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:46,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 06:21:46,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 06:21:46,363 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 06:21:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:46,473 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2023-12-21 06:21:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 06:21:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-21 06:21:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:46,475 INFO L225 Difference]: With dead ends: 44 [2023-12-21 06:21:46,475 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 06:21:46,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 06:21:46,479 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:46,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:21:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 06:21:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-21 06:21:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 06:21:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-12-21 06:21:46,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2023-12-21 06:21:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:46,496 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-12-21 06:21:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 06:21:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-12-21 06:21:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 06:21:46,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:46,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:46,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 06:21:46,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:46,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:46,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1203735897, now seen corresponding path program 1 times [2023-12-21 06:21:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355366018] [2023-12-21 06:21:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:46,724 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:46,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787494087] [2023-12-21 06:21:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:46,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:46,736 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) [2023-12-21 06:21:46,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 06:21:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:46,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 06:21:46,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 06:21:46,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:46,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355366018] [2023-12-21 06:21:46,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787494087] [2023-12-21 06:21:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787494087] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 06:21:46,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 06:21:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-12-21 06:21:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205055082] [2023-12-21 06:21:46,987 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:46,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 06:21:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:46,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 06:21:46,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-21 06:21:46,990 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 06:21:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:47,136 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-21 06:21:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 06:21:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-21 06:21:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:47,138 INFO L225 Difference]: With dead ends: 48 [2023-12-21 06:21:47,138 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 06:21:47,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-21 06:21:47,142 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:47,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:21:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 06:21:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-21 06:21:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 06:21:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2023-12-21 06:21:47,158 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 23 [2023-12-21 06:21:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:47,158 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-12-21 06:21:47,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 06:21:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2023-12-21 06:21:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 06:21:47,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:47,159 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:47,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:47,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-21 06:21:47,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:47,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 705122187, now seen corresponding path program 1 times [2023-12-21 06:21:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:47,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280454370] [2023-12-21 06:21:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:47,379 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:47,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445865010] [2023-12-21 06:21:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:47,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:47,381 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) [2023-12-21 06:21:47,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 06:21:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:47,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 06:21:47,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 06:21:47,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:47,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280454370] [2023-12-21 06:21:47,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445865010] [2023-12-21 06:21:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445865010] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 06:21:47,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 06:21:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-12-21 06:21:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780867713] [2023-12-21 06:21:47,532 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:47,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 06:21:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:47,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 06:21:47,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 06:21:47,534 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 06:21:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:47,610 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2023-12-21 06:21:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 06:21:47,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-21 06:21:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:47,614 INFO L225 Difference]: With dead ends: 70 [2023-12-21 06:21:47,616 INFO L226 Difference]: Without dead ends: 66 [2023-12-21 06:21:47,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 06:21:47,620 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:47,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 87 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:21:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-21 06:21:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-21 06:21:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 06:21:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2023-12-21 06:21:47,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 28 [2023-12-21 06:21:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:47,637 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2023-12-21 06:21:47,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 06:21:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2023-12-21 06:21:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 06:21:47,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:47,638 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:47,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:47,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:47,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:47,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1795283768, now seen corresponding path program 1 times [2023-12-21 06:21:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530308413] [2023-12-21 06:21:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:47,855 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:47,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757998598] [2023-12-21 06:21:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:47,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:47,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:47,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:47,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 06:21:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:47,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 06:21:47,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:21:47,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 06:21:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530308413] [2023-12-21 06:21:47,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757998598] [2023-12-21 06:21:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757998598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:21:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:21:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 06:21:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212069143] [2023-12-21 06:21:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:21:47,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 06:21:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 06:21:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 06:21:47,916 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 06:21:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:47,948 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2023-12-21 06:21:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 06:21:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2023-12-21 06:21:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:47,949 INFO L225 Difference]: With dead ends: 82 [2023-12-21 06:21:47,949 INFO L226 Difference]: Without dead ends: 80 [2023-12-21 06:21:47,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 06:21:47,950 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:47,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:21:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-21 06:21:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2023-12-21 06:21:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 44 states have internal predecessors, (49), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 06:21:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2023-12-21 06:21:47,959 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 34 [2023-12-21 06:21:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:47,960 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2023-12-21 06:21:47,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 06:21:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2023-12-21 06:21:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 06:21:47,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:47,961 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:47,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:48,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:48,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:48,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash -427827123, now seen corresponding path program 1 times [2023-12-21 06:21:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488265406] [2023-12-21 06:21:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:48,173 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335692714] [2023-12-21 06:21:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:48,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:48,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:48,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:48,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 06:21:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:48,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 06:21:48,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:21:48,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:21:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488265406] [2023-12-21 06:21:48,280 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335692714] [2023-12-21 06:21:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335692714] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:48,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-21 06:21:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666694214] [2023-12-21 06:21:48,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:48,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 06:21:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 06:21:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 06:21:48,281 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 06:21:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:48,412 INFO L93 Difference]: Finished difference Result 217 states and 285 transitions. [2023-12-21 06:21:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 06:21:48,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2023-12-21 06:21:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:48,413 INFO L225 Difference]: With dead ends: 217 [2023-12-21 06:21:48,413 INFO L226 Difference]: Without dead ends: 195 [2023-12-21 06:21:48,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-21 06:21:48,414 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:48,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 147 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:21:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-21 06:21:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2023-12-21 06:21:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 118 states have internal predecessors, (131), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 06:21:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2023-12-21 06:21:48,446 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 37 [2023-12-21 06:21:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:48,446 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2023-12-21 06:21:48,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 06:21:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2023-12-21 06:21:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 06:21:48,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:48,447 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:48,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:48,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:48,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:48,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -426158827, now seen corresponding path program 1 times [2023-12-21 06:21:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547216065] [2023-12-21 06:21:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:48,664 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854406273] [2023-12-21 06:21:48,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:48,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:48,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:48,665 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:48,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 06:21:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:48,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 06:21:48,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 06:21:48,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:48,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547216065] [2023-12-21 06:21:48,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854406273] [2023-12-21 06:21:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854406273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 06:21:48,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 06:21:48,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-12-21 06:21:48,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098968213] [2023-12-21 06:21:48,866 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:48,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 06:21:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 06:21:48,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 06:21:48,867 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 06:21:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:48,968 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2023-12-21 06:21:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 06:21:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-21 06:21:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:48,970 INFO L225 Difference]: With dead ends: 203 [2023-12-21 06:21:48,970 INFO L226 Difference]: Without dead ends: 198 [2023-12-21 06:21:48,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 06:21:48,973 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:48,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:21:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-21 06:21:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-12-21 06:21:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-21 06:21:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2023-12-21 06:21:49,024 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2023-12-21 06:21:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:49,024 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2023-12-21 06:21:49,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 06:21:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2023-12-21 06:21:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-21 06:21:49,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:49,026 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:49,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 06:21:49,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:49,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:49,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1298990710, now seen corresponding path program 1 times [2023-12-21 06:21:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039220385] [2023-12-21 06:21:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:49,240 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459500664] [2023-12-21 06:21:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:49,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:49,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:49,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 06:21:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:49,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 06:21:49,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:21:49,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:21:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039220385] [2023-12-21 06:21:49,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459500664] [2023-12-21 06:21:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459500664] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:49,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:49,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-12-21 06:21:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849353908] [2023-12-21 06:21:49,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:49,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 06:21:49,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:49,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 06:21:49,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 06:21:49,530 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 06:21:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:49,680 INFO L93 Difference]: Finished difference Result 227 states and 285 transitions. [2023-12-21 06:21:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 06:21:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2023-12-21 06:21:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:49,684 INFO L225 Difference]: With dead ends: 227 [2023-12-21 06:21:49,684 INFO L226 Difference]: Without dead ends: 211 [2023-12-21 06:21:49,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-21 06:21:49,686 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:49,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:21:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-21 06:21:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2023-12-21 06:21:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 126 states have (on average 1.1666666666666667) internal successors, (147), 137 states have internal predecessors, (147), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-21 06:21:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2023-12-21 06:21:49,737 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 39 [2023-12-21 06:21:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:49,738 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2023-12-21 06:21:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 06:21:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2023-12-21 06:21:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 06:21:49,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:49,741 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:49,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:49,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:49,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1786533347, now seen corresponding path program 2 times [2023-12-21 06:21:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:49,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437235693] [2023-12-21 06:21:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:49,952 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140972399] [2023-12-21 06:21:49,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 06:21:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:49,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:50,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 06:21:50,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 06:21:50,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:21:50,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 06:21:50,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-21 06:21:50,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-21 06:21:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437235693] [2023-12-21 06:21:50,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140972399] [2023-12-21 06:21:50,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140972399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:50,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:50,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-21 06:21:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348099186] [2023-12-21 06:21:50,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:50,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 06:21:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:50,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 06:21:50,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-21 06:21:50,481 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-21 06:21:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:51,331 INFO L93 Difference]: Finished difference Result 248 states and 309 transitions. [2023-12-21 06:21:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 06:21:51,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2023-12-21 06:21:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:51,334 INFO L225 Difference]: With dead ends: 248 [2023-12-21 06:21:51,334 INFO L226 Difference]: Without dead ends: 224 [2023-12-21 06:21:51,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-12-21 06:21:51,349 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:51,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 218 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 06:21:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-21 06:21:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2023-12-21 06:21:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.128787878787879) internal successors, (149), 140 states have internal predecessors, (149), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-21 06:21:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2023-12-21 06:21:51,416 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 42 [2023-12-21 06:21:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:51,416 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2023-12-21 06:21:51,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-21 06:21:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2023-12-21 06:21:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 06:21:51,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:51,418 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:51,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:51,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 06:21:51,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:51,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash -882918259, now seen corresponding path program 1 times [2023-12-21 06:21:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493353893] [2023-12-21 06:21:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:51,630 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430073321] [2023-12-21 06:21:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:51,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:51,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:51,653 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:51,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 06:21:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:21:51,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 06:21:51,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-21 06:21:52,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-21 06:21:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493353893] [2023-12-21 06:21:52,292 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430073321] [2023-12-21 06:21:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430073321] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:52,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:52,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-12-21 06:21:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484072824] [2023-12-21 06:21:52,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:52,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 06:21:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 06:21:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-21 06:21:52,294 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-21 06:21:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:52,722 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2023-12-21 06:21:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 06:21:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 56 [2023-12-21 06:21:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:52,724 INFO L225 Difference]: With dead ends: 217 [2023-12-21 06:21:52,724 INFO L226 Difference]: Without dead ends: 190 [2023-12-21 06:21:52,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-12-21 06:21:52,725 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:52,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 319 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 06:21:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-21 06:21:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2023-12-21 06:21:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 123 states have (on average 1.113821138211382) internal successors, (137), 127 states have internal predecessors, (137), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 06:21:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2023-12-21 06:21:52,770 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 56 [2023-12-21 06:21:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:52,770 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2023-12-21 06:21:52,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-21 06:21:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2023-12-21 06:21:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-21 06:21:52,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:52,772 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:52,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:52,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:52,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -11441917, now seen corresponding path program 2 times [2023-12-21 06:21:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383491205] [2023-12-21 06:21:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:52,984 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707989216] [2023-12-21 06:21:52,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 06:21:52,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:53,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:53,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 06:21:53,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 06:21:53,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:21:53,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 06:21:53,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-21 06:21:53,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-21 06:21:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383491205] [2023-12-21 06:21:53,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707989216] [2023-12-21 06:21:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707989216] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:53,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 06:21:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218577734] [2023-12-21 06:21:53,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:53,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 06:21:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 06:21:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-21 06:21:53,363 INFO L87 Difference]: Start difference. First operand 184 states and 207 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2023-12-21 06:21:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:53,604 INFO L93 Difference]: Finished difference Result 511 states and 600 transitions. [2023-12-21 06:21:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 06:21:53,605 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 94 [2023-12-21 06:21:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:53,607 INFO L225 Difference]: With dead ends: 511 [2023-12-21 06:21:53,607 INFO L226 Difference]: Without dead ends: 502 [2023-12-21 06:21:53,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-12-21 06:21:53,608 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:53,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 135 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:21:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-21 06:21:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2023-12-21 06:21:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 333 states have (on average 1.0960960960960962) internal successors, (365), 343 states have internal predecessors, (365), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-21 06:21:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 567 transitions. [2023-12-21 06:21:53,664 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 567 transitions. Word has length 94 [2023-12-21 06:21:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:53,665 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 567 transitions. [2023-12-21 06:21:53,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2023-12-21 06:21:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 567 transitions. [2023-12-21 06:21:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-21 06:21:53,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:53,668 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:53,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-21 06:21:53,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-21 06:21:53,873 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:53,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1428770883, now seen corresponding path program 3 times [2023-12-21 06:21:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:53,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941218088] [2023-12-21 06:21:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:53,909 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951806266] [2023-12-21 06:21:53,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 06:21:53,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:53,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:53,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:53,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 06:21:54,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-12-21 06:21:54,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:21:54,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 06:21:54,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 06:21:54,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2023-12-21 06:21:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941218088] [2023-12-21 06:21:54,588 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951806266] [2023-12-21 06:21:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951806266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:54,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-21 06:21:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088155700] [2023-12-21 06:21:54,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:54,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 06:21:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 06:21:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-12-21 06:21:54,590 INFO L87 Difference]: Start difference. First operand 502 states and 567 transitions. Second operand has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2023-12-21 06:21:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:55,106 INFO L93 Difference]: Finished difference Result 1147 states and 1344 transitions. [2023-12-21 06:21:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-21 06:21:55,106 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) Word has length 208 [2023-12-21 06:21:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:55,110 INFO L225 Difference]: With dead ends: 1147 [2023-12-21 06:21:55,110 INFO L226 Difference]: Without dead ends: 1138 [2023-12-21 06:21:55,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-12-21 06:21:55,112 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 154 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:55,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 219 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 06:21:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2023-12-21 06:21:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2023-12-21 06:21:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 753 states have (on average 1.0903054448871181) internal successors, (821), 775 states have internal predecessors, (821), 234 states have call successors, (234), 150 states have call predecessors, (234), 150 states have return successors, (232), 212 states have call predecessors, (232), 232 states have call successors, (232) [2023-12-21 06:21:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1287 transitions. [2023-12-21 06:21:55,228 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1287 transitions. Word has length 208 [2023-12-21 06:21:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:55,228 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1287 transitions. [2023-12-21 06:21:55,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2023-12-21 06:21:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1287 transitions. [2023-12-21 06:21:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2023-12-21 06:21:55,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:55,235 INFO L195 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:55,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:55,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 06:21:55,441 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:55,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -534892861, now seen corresponding path program 4 times [2023-12-21 06:21:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911907093] [2023-12-21 06:21:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:55,466 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:55,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641623226] [2023-12-21 06:21:55,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 06:21:55,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:55,467 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:55,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 06:21:55,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 06:21:55,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:21:55,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-21 06:21:55,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:21:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-21 06:21:56,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:21:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2023-12-21 06:21:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:21:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911907093] [2023-12-21 06:21:57,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:21:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641623226] [2023-12-21 06:21:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641623226] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:21:57,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:21:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-12-21 06:21:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400959145] [2023-12-21 06:21:57,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:21:57,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-21 06:21:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:21:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-21 06:21:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-12-21 06:21:57,270 INFO L87 Difference]: Start difference. First operand 1138 states and 1287 transitions. Second operand has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2023-12-21 06:21:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:21:59,001 INFO L93 Difference]: Finished difference Result 2419 states and 2832 transitions. [2023-12-21 06:21:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-21 06:21:59,021 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) Word has length 436 [2023-12-21 06:21:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:21:59,051 INFO L225 Difference]: With dead ends: 2419 [2023-12-21 06:21:59,051 INFO L226 Difference]: Without dead ends: 2410 [2023-12-21 06:21:59,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 822 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-12-21 06:21:59,080 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 404 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 06:21:59,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 400 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 06:21:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2023-12-21 06:21:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2023-12-21 06:21:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 1593 states have (on average 1.0878844946641557) internal successors, (1733), 1639 states have internal predecessors, (1733), 498 states have call successors, (498), 318 states have call predecessors, (498), 318 states have return successors, (496), 452 states have call predecessors, (496), 496 states have call successors, (496) [2023-12-21 06:21:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 2727 transitions. [2023-12-21 06:21:59,553 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 2727 transitions. Word has length 436 [2023-12-21 06:21:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:21:59,554 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 2727 transitions. [2023-12-21 06:21:59,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2023-12-21 06:21:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2727 transitions. [2023-12-21 06:21:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2023-12-21 06:21:59,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:21:59,605 INFO L195 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:21:59,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 06:21:59,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 06:21:59,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:21:59,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:21:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1540107203, now seen corresponding path program 5 times [2023-12-21 06:21:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:21:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535185257] [2023-12-21 06:21:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:21:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:21:59,896 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:21:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095545703] [2023-12-21 06:21:59,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 06:21:59,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:21:59,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:21:59,908 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:21:59,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-21 06:30:29,263 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2023-12-21 06:30:29,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:30:29,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-21 06:30:29,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:30:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-12-21 06:30:30,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:30:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2023-12-21 06:30:33,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:30:33,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535185257] [2023-12-21 06:30:33,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:30:33,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095545703] [2023-12-21 06:30:33,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095545703] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:30:33,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:30:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-12-21 06:30:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106509550] [2023-12-21 06:30:33,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:30:33,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-12-21 06:30:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:30:33,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-12-21 06:30:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-12-21 06:30:33,148 INFO L87 Difference]: Start difference. First operand 2410 states and 2727 transitions. Second operand has 98 states, 98 states have (on average 5.36734693877551) internal successors, (526), 98 states have internal predecessors, (526), 95 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) [2023-12-21 06:30:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:30:38,883 INFO L93 Difference]: Finished difference Result 4963 states and 5808 transitions. [2023-12-21 06:30:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-12-21 06:30:38,884 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.36734693877551) internal successors, (526), 98 states have internal predecessors, (526), 95 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) Word has length 892 [2023-12-21 06:30:38,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:30:38,899 INFO L225 Difference]: With dead ends: 4963 [2023-12-21 06:30:38,899 INFO L226 Difference]: Without dead ends: 4954 [2023-12-21 06:30:38,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1875 GetRequests, 1686 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-12-21 06:30:38,907 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 926 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 06:30:38,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 676 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 06:30:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2023-12-21 06:30:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4954. [2023-12-21 06:30:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4954 states, 3273 states have (on average 1.0867705468988695) internal successors, (3557), 3367 states have internal predecessors, (3557), 1026 states have call successors, (1026), 654 states have call predecessors, (1026), 654 states have return successors, (1024), 932 states have call predecessors, (1024), 1024 states have call successors, (1024) [2023-12-21 06:30:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 5607 transitions. [2023-12-21 06:30:39,424 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 5607 transitions. Word has length 892 [2023-12-21 06:30:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:30:39,425 INFO L495 AbstractCegarLoop]: Abstraction has 4954 states and 5607 transitions. [2023-12-21 06:30:39,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.36734693877551) internal successors, (526), 98 states have internal predecessors, (526), 95 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) [2023-12-21 06:30:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 5607 transitions. [2023-12-21 06:30:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1805 [2023-12-21 06:30:39,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:30:39,489 INFO L195 NwaCegarLoop]: trace histogram [283, 282, 282, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:30:39,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-21 06:30:39,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-21 06:30:39,704 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:30:39,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:30:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1203316163, now seen corresponding path program 6 times [2023-12-21 06:30:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:30:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951093978] [2023-12-21 06:30:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:30:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:30:39,754 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:30:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294788606] [2023-12-21 06:30:39,754 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 06:30:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:30:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:30:39,755 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:30:39,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-21 06:33:45,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 179 check-sat command(s) [2023-12-21 06:33:45,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:33:45,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 3822 conjuncts, 191 conjunts are in the unsatisfiable core [2023-12-21 06:33:45,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:33:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 188141 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2023-12-21 06:33:49,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:33:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 30785 refuted. 0 times theorem prover too weak. 158488 trivial. 0 not checked. [2023-12-21 06:33:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:33:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951093978] [2023-12-21 06:33:52,623 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:33:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294788606] [2023-12-21 06:33:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294788606] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:33:52,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:33:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-12-21 06:33:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520812810] [2023-12-21 06:33:52,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:33:52,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-12-21 06:33:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:33:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-12-21 06:33:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-12-21 06:33:52,648 INFO L87 Difference]: Start difference. First operand 4954 states and 5607 transitions. Second operand has 104 states, 104 states have (on average 6.711538461538462) internal successors, (698), 104 states have internal predecessors, (698), 101 states have call successors, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) [2023-12-21 06:33:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:33:57,102 INFO L93 Difference]: Finished difference Result 5281 states and 6000 transitions. [2023-12-21 06:33:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-12-21 06:33:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.711538461538462) internal successors, (698), 104 states have internal predecessors, (698), 101 states have call successors, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) Word has length 1804 [2023-12-21 06:33:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:33:57,146 INFO L225 Difference]: With dead ends: 5281 [2023-12-21 06:33:57,146 INFO L226 Difference]: Without dead ends: 5272 [2023-12-21 06:33:57,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3705 GetRequests, 3414 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-12-21 06:33:57,165 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 422 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 06:33:57,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 724 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 06:33:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2023-12-21 06:33:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5272. [2023-12-21 06:33:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5272 states, 3483 states have (on average 1.0867068619006603) internal successors, (3785), 3583 states have internal predecessors, (3785), 1092 states have call successors, (1092), 696 states have call predecessors, (1092), 696 states have return successors, (1090), 992 states have call predecessors, (1090), 1090 states have call successors, (1090) [2023-12-21 06:33:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 5967 transitions. [2023-12-21 06:33:57,642 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 5967 transitions. Word has length 1804 [2023-12-21 06:33:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:33:57,645 INFO L495 AbstractCegarLoop]: Abstraction has 5272 states and 5967 transitions. [2023-12-21 06:33:57,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.711538461538462) internal successors, (698), 104 states have internal predecessors, (698), 101 states have call successors, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) [2023-12-21 06:33:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 5967 transitions. [2023-12-21 06:33:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2023-12-21 06:33:57,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:33:57,674 INFO L195 NwaCegarLoop]: trace histogram [301, 300, 300, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:33:57,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-21 06:33:57,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:33:57,892 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:33:57,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:33:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2033868035, now seen corresponding path program 7 times [2023-12-21 06:33:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:33:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266994064] [2023-12-21 06:33:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:33:57,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:33:57,976 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:33:57,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119962784] [2023-12-21 06:33:57,976 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 06:33:57,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:33:57,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:33:57,994 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:33:57,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-21 06:33:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 06:33:58,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 06:33:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 06:33:59,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 06:33:59,671 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 06:33:59,671 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 06:33:59,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-21 06:33:59,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-21 06:33:59,890 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:33:59,895 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 06:34:00,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:34:00 BoogieIcfgContainer [2023-12-21 06:34:00,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 06:34:00,077 INFO L158 Benchmark]: Toolchain (without parser) took 734769.91ms. Allocated memory was 253.8MB in the beginning and 549.5MB in the end (delta: 295.7MB). Free memory was 215.2MB in the beginning and 198.6MB in the end (delta: 16.6MB). Peak memory consumption was 312.8MB. Max. memory is 8.0GB. [2023-12-21 06:34:00,077 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 06:34:00,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.56ms. Allocated memory is still 253.8MB. Free memory was 215.2MB in the beginning and 203.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 06:34:00,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.33ms. Allocated memory is still 253.8MB. Free memory was 203.7MB in the beginning and 202.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 06:34:00,077 INFO L158 Benchmark]: Boogie Preprocessor took 22.25ms. Allocated memory is still 253.8MB. Free memory was 202.1MB in the beginning and 200.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 06:34:00,077 INFO L158 Benchmark]: RCFGBuilder took 212.55ms. Allocated memory is still 253.8MB. Free memory was 200.5MB in the beginning and 188.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 06:34:00,078 INFO L158 Benchmark]: TraceAbstraction took 734334.64ms. Allocated memory was 253.8MB in the beginning and 549.5MB in the end (delta: 295.7MB). Free memory was 188.0MB in the beginning and 198.6MB in the end (delta: -10.6MB). Peak memory consumption was 285.6MB. Max. memory is 8.0GB. [2023-12-21 06:34:00,078 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.10ms. Allocated memory is still 178.3MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.56ms. Allocated memory is still 253.8MB. Free memory was 215.2MB in the beginning and 203.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.33ms. Allocated memory is still 253.8MB. Free memory was 203.7MB in the beginning and 202.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.25ms. Allocated memory is still 253.8MB. Free memory was 202.1MB in the beginning and 200.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 212.55ms. Allocated memory is still 253.8MB. Free memory was 200.5MB in the beginning and 188.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 734334.64ms. Allocated memory was 253.8MB in the beginning and 549.5MB in the end (delta: 295.7MB). Free memory was 188.0MB in the beginning and 198.6MB in the end (delta: -10.6MB). Peak memory consumption was 285.6MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=203, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=203, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=203, b=2, counter=0, p=1, q=0, r=0, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=201, b=2, counter=1, p=1, q=0, r=-1, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=199, b=2, counter=2, p=1, q=0, r=-2, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=197, b=2, counter=3, p=1, q=0, r=-3, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=195, b=2, counter=4, p=1, q=0, r=-4, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=193, b=2, counter=5, p=1, q=0, r=-5, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=191, b=2, counter=6, p=1, q=0, r=-6, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=189, b=2, counter=7, p=1, q=0, r=-7, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=187, b=2, counter=8, p=1, q=0, r=-8, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=185, b=2, counter=9, p=1, q=0, r=-9, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=183, b=2, counter=10, p=1, q=0, r=-10, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=181, b=2, counter=11, p=1, q=0, r=-11, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=179, b=2, counter=12, p=1, q=0, r=-12, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=177, b=2, counter=13, p=1, q=0, r=-13, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=175, b=2, counter=14, p=1, q=0, r=-14, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=173, b=2, counter=15, p=1, q=0, r=-15, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=171, b=2, counter=16, p=1, q=0, r=-16, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=169, b=2, counter=17, p=1, q=0, r=-17, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=167, b=2, counter=18, p=1, q=0, r=-18, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=165, b=2, counter=19, p=1, q=0, r=-19, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=163, b=2, counter=20, p=1, q=0, r=-20, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=161, b=2, counter=21, p=1, q=0, r=-21, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=159, b=2, counter=22, p=1, q=0, r=-22, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=157, b=2, counter=23, p=1, q=0, r=-23, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=155, b=2, counter=24, p=1, q=0, r=-24, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=153, b=2, counter=25, p=1, q=0, r=-25, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=151, b=2, counter=26, p=1, q=0, r=-26, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=149, b=2, counter=27, p=1, q=0, r=-27, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=147, b=2, counter=28, p=1, q=0, r=-28, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=145, b=2, counter=29, p=1, q=0, r=-29, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=143, b=2, counter=30, p=1, q=0, r=-30, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=141, b=2, counter=31, p=1, q=0, r=-31, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=139, b=2, counter=32, p=1, q=0, r=-32, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=137, b=2, counter=33, p=1, q=0, r=-33, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=135, b=2, counter=34, p=1, q=0, r=-34, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=133, b=2, counter=35, p=1, q=0, r=-35, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=131, b=2, counter=36, p=1, q=0, r=-36, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=129, b=2, counter=37, p=1, q=0, r=-37, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=127, b=2, counter=38, p=1, q=0, r=-38, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=125, b=2, counter=39, p=1, q=0, r=-39, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=123, b=2, counter=40, p=1, q=0, r=-40, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=121, b=2, counter=41, p=1, q=0, r=-41, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=119, b=2, counter=42, p=1, q=0, r=-42, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=117, b=2, counter=43, p=1, q=0, r=-43, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=115, b=2, counter=44, p=1, q=0, r=-44, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=113, b=2, counter=45, p=1, q=0, r=-45, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=111, b=2, counter=46, p=1, q=0, r=-46, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=109, b=2, counter=47, p=1, q=0, r=-47, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=107, b=2, counter=48, p=1, q=0, r=-48, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=105, b=2, counter=49, p=1, q=0, r=-49, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=103, b=2, counter=50, p=1, q=0, r=-50, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=101, b=2, counter=51, p=1, q=0, r=-51, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=99, b=2, counter=52, p=1, q=0, r=-52, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=97, b=2, counter=53, p=1, q=0, r=-53, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=95, b=2, counter=54, p=1, q=0, r=-54, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=93, b=2, counter=55, p=1, q=0, r=-55, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=91, b=2, counter=56, p=1, q=0, r=-56, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=89, b=2, counter=57, p=1, q=0, r=-57, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=87, b=2, counter=58, p=1, q=0, r=-58, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=85, b=2, counter=59, p=1, q=0, r=-59, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=83, b=2, counter=60, p=1, q=0, r=-60, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=81, b=2, counter=61, p=1, q=0, r=-61, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=79, b=2, counter=62, p=1, q=0, r=-62, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=77, b=2, counter=63, p=1, q=0, r=-63, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=75, b=2, counter=64, p=1, q=0, r=-64, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=73, b=2, counter=65, p=1, q=0, r=-65, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=71, b=2, counter=66, p=1, q=0, r=-66, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=69, b=2, counter=67, p=1, q=0, r=-67, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=67, b=2, counter=68, p=1, q=0, r=-68, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=65, b=2, counter=69, p=1, q=0, r=-69, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=63, b=2, counter=70, p=1, q=0, r=-70, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=61, b=2, counter=71, p=1, q=0, r=-71, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=59, b=2, counter=72, p=1, q=0, r=-72, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=57, b=2, counter=73, p=1, q=0, r=-73, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=55, b=2, counter=74, p=1, q=0, r=-74, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=53, b=2, counter=75, p=1, q=0, r=-75, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=2, counter=76, p=1, q=0, r=-76, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=2, counter=77, p=1, q=0, r=-77, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=2, counter=78, p=1, q=0, r=-78, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=2, counter=79, p=1, q=0, r=-79, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=2, counter=80, p=1, q=0, r=-80, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=2, counter=81, p=1, q=0, r=-81, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=2, counter=82, p=1, q=0, r=-82, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=2, counter=83, p=1, q=0, r=-83, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=2, counter=84, p=1, q=0, r=-84, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=2, counter=85, p=1, q=0, r=-85, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=2, counter=86, p=1, q=0, r=-86, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=2, counter=87, p=1, q=0, r=-87, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=2, counter=88, p=1, q=0, r=-88, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=2, counter=89, p=1, q=0, r=-89, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=2, counter=90, p=1, q=0, r=-90, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=2, counter=91, p=1, q=0, r=-91, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=2, counter=92, p=1, q=0, r=-92, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=2, counter=93, p=1, q=0, r=-93, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=2, counter=94, p=1, q=0, r=-94, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=2, counter=95, p=1, q=0, r=-95, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=2, counter=96, p=1, q=0, r=-96, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=2, counter=97, p=1, q=0, r=-97, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=2, counter=98, p=1, q=0, r=-98, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=2, counter=99, p=1, q=0, r=-99, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=2, counter=100, p=1, q=0, r=-100, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=101, p=1, q=0, r=-100, s=1, x=203, y=2] [L34] COND FALSE !(counter++<100) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=101] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 734.1s, OverallIterations: 17, TraceHistogramMax: 301, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2219 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2187 mSDsluCounter, 3686 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3232 mSDsCounter, 568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3241 IncrementalHoareTripleChecker+Invalid, 3809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 568 mSolverCounterUnsat, 454 mSDtfsCounter, 3241 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7660 GetRequests, 6916 SyntacticMatches, 91 SemanticMatches, 653 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16725 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5272occurred in iteration=16, InterpolantAutomatonStates: 638, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 695.9s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 5701 NumberOfCodeBlocks, 5681 NumberOfCodeBlocksAsserted, 306 NumberOfCheckSat, 7366 ConstructedInterpolants, 0 QuantifiedInterpolants, 18110 SizeOfPredicates, 207 NumberOfNonLiveVariables, 8301 ConjunctsInSsa, 535 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 211544/496703 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-21 06:34:00,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...