/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/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:54:04,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:54:04,572 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-16 04:54:04,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:54:04,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:54:04,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:54:04,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:54:04,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:54:04,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:54:04,623 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:54:04,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:54:04,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:54:04,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:54:04,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:54:04,626 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:54:04,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:54:04,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:54:04,626 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:54:04,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:54:04,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:54:04,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:54:04,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:54:04,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:54:04,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:54:04,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:54:04,628 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:54:04,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:54:04,628 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:54:04,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:54:04,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:54:04,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:54:04,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:54:04,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:54:04,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:54:04,631 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:54:04,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:54:04,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:54:04,632 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-16 04:54:04,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:54:04,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:54:04,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:54:04,881 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:54:04,881 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:54:04,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2023-12-16 04:54:06,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:54:06,247 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:54:06,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2023-12-16 04:54:06,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bed392a7/28b06238a1ee454f9da8a824a58dc5e5/FLAGd1028906d [2023-12-16 04:54:06,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bed392a7/28b06238a1ee454f9da8a824a58dc5e5 [2023-12-16 04:54:06,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:54:06,268 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:54:06,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:54:06,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:54:06,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:54:06,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6784086e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06, skipping insertion in model container [2023-12-16 04:54:06,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,297 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:54:06,439 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2023-12-16 04:54:06,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:54:06,465 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:54:06,473 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2023-12-16 04:54:06,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:54:06,489 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:54:06,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06 WrapperNode [2023-12-16 04:54:06,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:54:06,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:54:06,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:54:06,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:54:06,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,515 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-12-16 04:54:06,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:54:06,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:54:06,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:54:06,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:54:06,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,533 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-16 04:54:06,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:54:06,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:54:06,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:54:06,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:54:06,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (1/1) ... [2023-12-16 04:54:06,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:54:06,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:06,573 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-16 04:54:06,578 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-16 04:54:06,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:54:06,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:54:06,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:54:06,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:54:06,640 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:54:06,642 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:54:06,755 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:54:06,777 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:54:06,778 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 04:54:06,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:54:06 BoogieIcfgContainer [2023-12-16 04:54:06,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:54:06,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:54:06,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:54:06,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:54:06,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:54:06" (1/3) ... [2023-12-16 04:54:06,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520dc56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:54:06, skipping insertion in model container [2023-12-16 04:54:06,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:54:06" (2/3) ... [2023-12-16 04:54:06,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520dc56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:54:06, skipping insertion in model container [2023-12-16 04:54:06,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:54:06" (3/3) ... [2023-12-16 04:54:06,785 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2023-12-16 04:54:06,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:54:06,799 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:54:06,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:54:06,841 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;@6546d731, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:54:06,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:54:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:54:06,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:06,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:06,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:06,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1500602288, now seen corresponding path program 1 times [2023-12-16 04:54:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695991964] [2023-12-16 04:54:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:07,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695991964] [2023-12-16 04:54:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695991964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:07,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:07,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:54:07,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163789800] [2023-12-16 04:54:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:07,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:54:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:54:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:54:07,087 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:07,118 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2023-12-16 04:54:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:54:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 04:54:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:07,140 INFO L225 Difference]: With dead ends: 32 [2023-12-16 04:54:07,140 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 04:54:07,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 04:54:07,146 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:07,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:54:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 04:54:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 04:54:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2023-12-16 04:54:07,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2023-12-16 04:54:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:07,188 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-12-16 04:54:07,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2023-12-16 04:54:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:54:07,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:07,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:07,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:54:07,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:07,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash -65030621, now seen corresponding path program 1 times [2023-12-16 04:54:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832972362] [2023-12-16 04:54:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832972362] [2023-12-16 04:54:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832972362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:07,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:54:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960478454] [2023-12-16 04:54:07,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:07,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:54:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:54:07,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:54:07,365 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:07,424 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2023-12-16 04:54:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:54:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 04:54:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:07,425 INFO L225 Difference]: With dead ends: 33 [2023-12-16 04:54:07,425 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 04:54:07,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:54:07,427 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:07,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 04:54:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-12-16 04:54:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2023-12-16 04:54:07,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2023-12-16 04:54:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:07,434 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2023-12-16 04:54:07,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2023-12-16 04:54:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:54:07,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:07,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:07,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:54:07,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:07,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1812390471, now seen corresponding path program 1 times [2023-12-16 04:54:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136337517] [2023-12-16 04:54:07,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:54:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:07,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136337517] [2023-12-16 04:54:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136337517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:54:07,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509563879] [2023-12-16 04:54:07,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:07,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:54:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:07,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:54:07,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:54:07,515 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:07,552 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-12-16 04:54:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:54:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 04:54:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:07,554 INFO L225 Difference]: With dead ends: 40 [2023-12-16 04:54:07,554 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 04:54:07,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:54:07,560 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:07,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:54:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 04:54:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-12-16 04:54:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-12-16 04:54:07,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 14 [2023-12-16 04:54:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:07,568 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-12-16 04:54:07,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-12-16 04:54:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:54:07,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:07,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:07,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:54:07,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:07,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1869648773, now seen corresponding path program 1 times [2023-12-16 04:54:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886894684] [2023-12-16 04:54:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:54:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886894684] [2023-12-16 04:54:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886894684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:54:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657794788] [2023-12-16 04:54:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:54:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:54:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:54:07,670 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:07,739 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2023-12-16 04:54:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:54:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 04:54:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:07,741 INFO L225 Difference]: With dead ends: 48 [2023-12-16 04:54:07,741 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 04:54:07,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:54:07,742 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:07,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 04:54:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-12-16 04:54:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2023-12-16 04:54:07,749 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 14 [2023-12-16 04:54:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:07,750 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2023-12-16 04:54:07,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2023-12-16 04:54:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:54:07,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:07,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:07,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:54:07,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:07,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1869708355, now seen corresponding path program 1 times [2023-12-16 04:54:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136639421] [2023-12-16 04:54:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:07,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136639421] [2023-12-16 04:54:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136639421] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649058008] [2023-12-16 04:54:07,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:07,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:07,853 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-16 04:54:07,874 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-16 04:54:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:07,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 04:54:07,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:08,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649058008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:08,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:08,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-12-16 04:54:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234591120] [2023-12-16 04:54:08,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:08,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:54:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:54:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:54:08,066 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:08,168 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2023-12-16 04:54:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:54:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 04:54:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:08,171 INFO L225 Difference]: With dead ends: 78 [2023-12-16 04:54:08,171 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 04:54:08,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:54:08,174 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:08,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 26 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 04:54:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-12-16 04:54:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2023-12-16 04:54:08,186 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 14 [2023-12-16 04:54:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:08,186 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2023-12-16 04:54:08,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2023-12-16 04:54:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 04:54:08,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:08,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:08,197 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-16 04:54:08,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:08,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:08,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash -584062177, now seen corresponding path program 2 times [2023-12-16 04:54:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:08,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158150357] [2023-12-16 04:54:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158150357] [2023-12-16 04:54:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158150357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250749421] [2023-12-16 04:54:08,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:54:08,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:08,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:08,549 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-16 04:54:08,552 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-16 04:54:08,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:54:08,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:54:08,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:54:08,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:54:08,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:54:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250749421] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:08,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-12-16 04:54:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812980015] [2023-12-16 04:54:08,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:08,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:54:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:54:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:54:08,797 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:09,238 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2023-12-16 04:54:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 04:54:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 04:54:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:09,245 INFO L225 Difference]: With dead ends: 236 [2023-12-16 04:54:09,245 INFO L226 Difference]: Without dead ends: 190 [2023-12-16 04:54:09,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 04:54:09,250 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 243 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:09,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 71 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-16 04:54:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2023-12-16 04:54:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2797619047619047) internal successors, (215), 168 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2023-12-16 04:54:09,289 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 23 [2023-12-16 04:54:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:09,289 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2023-12-16 04:54:09,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2023-12-16 04:54:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:54:09,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:09,291 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:09,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-16 04:54:09,497 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,SelfDestructingSolverStorable5 [2023-12-16 04:54:09,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:09,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash -268676385, now seen corresponding path program 1 times [2023-12-16 04:54:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088389817] [2023-12-16 04:54:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-16 04:54:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088389817] [2023-12-16 04:54:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088389817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:54:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038593584] [2023-12-16 04:54:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:09,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:54:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:09,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:54:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:54:09,564 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:09,597 INFO L93 Difference]: Finished difference Result 380 states and 486 transitions. [2023-12-16 04:54:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:54:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-16 04:54:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:09,599 INFO L225 Difference]: With dead ends: 380 [2023-12-16 04:54:09,599 INFO L226 Difference]: Without dead ends: 214 [2023-12-16 04:54:09,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:54:09,602 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:09,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:54:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-16 04:54:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2023-12-16 04:54:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2704081632653061) internal successors, (249), 196 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 249 transitions. [2023-12-16 04:54:09,636 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 249 transitions. Word has length 29 [2023-12-16 04:54:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:09,636 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 249 transitions. [2023-12-16 04:54:09,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 249 transitions. [2023-12-16 04:54:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 04:54:09,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:09,640 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:09,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:54:09,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:09,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash -651904133, now seen corresponding path program 1 times [2023-12-16 04:54:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:09,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872259416] [2023-12-16 04:54:09,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:09,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:09,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872259416] [2023-12-16 04:54:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872259416] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198202625] [2023-12-16 04:54:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:09,788 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-16 04:54:09,793 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-16 04:54:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:09,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 04:54:09,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:09,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198202625] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:10,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-12-16 04:54:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674528919] [2023-12-16 04:54:10,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:10,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-16 04:54:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-16 04:54:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2023-12-16 04:54:10,090 INFO L87 Difference]: Start difference. First operand 197 states and 249 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:10,295 INFO L93 Difference]: Finished difference Result 584 states and 800 transitions. [2023-12-16 04:54:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:54:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-16 04:54:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:10,297 INFO L225 Difference]: With dead ends: 584 [2023-12-16 04:54:10,297 INFO L226 Difference]: Without dead ends: 390 [2023-12-16 04:54:10,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2023-12-16 04:54:10,300 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:10,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 40 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-16 04:54:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2023-12-16 04:54:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.2603092783505154) internal successors, (489), 388 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 489 transitions. [2023-12-16 04:54:10,330 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 489 transitions. Word has length 30 [2023-12-16 04:54:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:10,330 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 489 transitions. [2023-12-16 04:54:10,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 489 transitions. [2023-12-16 04:54:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 04:54:10,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:10,334 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:10,340 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-16 04:54:10,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:10,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:10,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash -393067141, now seen corresponding path program 2 times [2023-12-16 04:54:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207876959] [2023-12-16 04:54:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:10,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:10,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207876959] [2023-12-16 04:54:10,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207876959] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:10,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194222059] [2023-12-16 04:54:10,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:54:10,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:10,956 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-16 04:54:10,974 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-16 04:54:11,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:54:11,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:54:11,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:54:11,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:11,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194222059] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:11,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:11,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2023-12-16 04:54:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540308431] [2023-12-16 04:54:11,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:11,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-16 04:54:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-16 04:54:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 04:54:11,599 INFO L87 Difference]: Start difference. First operand 389 states and 489 transitions. Second operand has 39 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:11,833 INFO L93 Difference]: Finished difference Result 920 states and 1204 transitions. [2023-12-16 04:54:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:54:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-16 04:54:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:11,837 INFO L225 Difference]: With dead ends: 920 [2023-12-16 04:54:11,837 INFO L226 Difference]: Without dead ends: 534 [2023-12-16 04:54:11,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2023-12-16 04:54:11,840 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 107 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:11,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 35 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-16 04:54:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 533. [2023-12-16 04:54:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.2575187969924813) internal successors, (669), 532 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 669 transitions. [2023-12-16 04:54:11,875 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 669 transitions. Word has length 54 [2023-12-16 04:54:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:11,876 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 669 transitions. [2023-12-16 04:54:11,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 669 transitions. [2023-12-16 04:54:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 04:54:11,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:11,877 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:11,885 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-16 04:54:12,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:12,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:12,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash -39994117, now seen corresponding path program 3 times [2023-12-16 04:54:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296185487] [2023-12-16 04:54:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296185487] [2023-12-16 04:54:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296185487] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359526982] [2023-12-16 04:54:12,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:54:12,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:12,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:12,912 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-16 04:54:12,916 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-16 04:54:12,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 04:54:12,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:54:12,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:54:12,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2023-12-16 04:54:13,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:54:13,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359526982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:13,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:54:13,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27] total 31 [2023-12-16 04:54:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310872619] [2023-12-16 04:54:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:13,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:54:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:54:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=631, Unknown=0, NotChecked=0, Total=930 [2023-12-16 04:54:13,194 INFO L87 Difference]: Start difference. First operand 533 states and 669 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:13,279 INFO L93 Difference]: Finished difference Result 741 states and 924 transitions. [2023-12-16 04:54:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:54:13,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-16 04:54:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:13,284 INFO L225 Difference]: With dead ends: 741 [2023-12-16 04:54:13,284 INFO L226 Difference]: Without dead ends: 739 [2023-12-16 04:54:13,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2023-12-16 04:54:13,285 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:13,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:54:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-12-16 04:54:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 731. [2023-12-16 04:54:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.247945205479452) internal successors, (911), 730 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 911 transitions. [2023-12-16 04:54:13,326 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 911 transitions. Word has length 72 [2023-12-16 04:54:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:13,326 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 911 transitions. [2023-12-16 04:54:13,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 911 transitions. [2023-12-16 04:54:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 04:54:13,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:13,328 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:13,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-16 04:54:13,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 04:54:13,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:13,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1263812091, now seen corresponding path program 1 times [2023-12-16 04:54:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527748350] [2023-12-16 04:54:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 04:54:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527748350] [2023-12-16 04:54:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527748350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-16 04:54:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426468676] [2023-12-16 04:54:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:13,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 04:54:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:13,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 04:54:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-12-16 04:54:13,895 INFO L87 Difference]: Start difference. First operand 731 states and 911 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:14,277 INFO L93 Difference]: Finished difference Result 3121 states and 4017 transitions. [2023-12-16 04:54:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:54:14,278 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-16 04:54:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:14,287 INFO L225 Difference]: With dead ends: 3121 [2023-12-16 04:54:14,287 INFO L226 Difference]: Without dead ends: 2670 [2023-12-16 04:54:14,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-12-16 04:54:14,289 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 511 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:14,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 149 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:54:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2023-12-16 04:54:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 738. [2023-12-16 04:54:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.1763907734056989) internal successors, (867), 737 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 867 transitions. [2023-12-16 04:54:14,362 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 867 transitions. Word has length 72 [2023-12-16 04:54:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:14,363 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 867 transitions. [2023-12-16 04:54:14,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 867 transitions. [2023-12-16 04:54:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 04:54:14,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:14,364 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:54:14,365 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:14,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1843662011, now seen corresponding path program 2 times [2023-12-16 04:54:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980005919] [2023-12-16 04:54:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980005919] [2023-12-16 04:54:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980005919] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94851400] [2023-12-16 04:54:15,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:54:15,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:15,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:15,104 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-16 04:54:15,133 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-16 04:54:15,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:54:15,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:54:15,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 04:54:15,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:16,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:54:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94851400] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:17,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 75 [2023-12-16 04:54:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526799738] [2023-12-16 04:54:17,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:17,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-12-16 04:54:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-12-16 04:54:17,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1499, Invalid=4201, Unknown=0, NotChecked=0, Total=5700 [2023-12-16 04:54:17,395 INFO L87 Difference]: Start difference. First operand 738 states and 867 transitions. Second operand has 76 states, 76 states have (on average 2.6842105263157894) internal successors, (204), 75 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:21,919 INFO L93 Difference]: Finished difference Result 1691 states and 2015 transitions. [2023-12-16 04:54:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-16 04:54:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.6842105263157894) internal successors, (204), 75 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-16 04:54:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:21,926 INFO L225 Difference]: With dead ends: 1691 [2023-12-16 04:54:21,926 INFO L226 Difference]: Without dead ends: 1295 [2023-12-16 04:54:21,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14867 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7152, Invalid=30678, Unknown=0, NotChecked=0, Total=37830 [2023-12-16 04:54:21,937 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 845 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:21,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 129 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:54:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-12-16 04:54:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1037. [2023-12-16 04:54:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 1.225868725868726) internal successors, (1270), 1036 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1270 transitions. [2023-12-16 04:54:22,021 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1270 transitions. Word has length 72 [2023-12-16 04:54:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:22,022 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1270 transitions. [2023-12-16 04:54:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.6842105263157894) internal successors, (204), 75 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1270 transitions. [2023-12-16 04:54:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 04:54:22,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:22,023 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:22,036 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-16 04:54:22,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:22,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:22,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1071231557, now seen corresponding path program 1 times [2023-12-16 04:54:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118398860] [2023-12-16 04:54:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-12-16 04:54:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118398860] [2023-12-16 04:54:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118398860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:54:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:54:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:54:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433717005] [2023-12-16 04:54:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:54:22,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:54:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:54:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:54:22,294 INFO L87 Difference]: Start difference. First operand 1037 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:22,418 INFO L93 Difference]: Finished difference Result 1733 states and 2123 transitions. [2023-12-16 04:54:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:54:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-16 04:54:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:22,423 INFO L225 Difference]: With dead ends: 1733 [2023-12-16 04:54:22,423 INFO L226 Difference]: Without dead ends: 1387 [2023-12-16 04:54:22,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:54:22,424 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 70 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:22,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:54:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2023-12-16 04:54:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1107. [2023-12-16 04:54:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 1.232368896925859) internal successors, (1363), 1106 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1363 transitions. [2023-12-16 04:54:22,548 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1363 transitions. Word has length 72 [2023-12-16 04:54:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:22,549 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1363 transitions. [2023-12-16 04:54:22,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1363 transitions. [2023-12-16 04:54:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:54:22,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:22,550 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:22,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:54:22,550 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:22,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash -38320176, now seen corresponding path program 1 times [2023-12-16 04:54:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:22,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44547754] [2023-12-16 04:54:22,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-12-16 04:54:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44547754] [2023-12-16 04:54:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44547754] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942816047] [2023-12-16 04:54:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:23,292 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-16 04:54:23,293 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-16 04:54:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:23,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-16 04:54:23,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-12-16 04:54:24,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1837 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2023-12-16 04:54:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942816047] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:25,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 26] total 74 [2023-12-16 04:54:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620274233] [2023-12-16 04:54:25,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:25,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-12-16 04:54:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-12-16 04:54:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1582, Invalid=3968, Unknown=0, NotChecked=0, Total=5550 [2023-12-16 04:54:25,893 INFO L87 Difference]: Start difference. First operand 1107 states and 1363 transitions. Second operand has 75 states, 75 states have (on average 3.12) internal successors, (234), 74 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:28,148 INFO L93 Difference]: Finished difference Result 1709 states and 2082 transitions. [2023-12-16 04:54:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-12-16 04:54:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.12) internal successors, (234), 74 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-16 04:54:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:28,151 INFO L225 Difference]: With dead ends: 1709 [2023-12-16 04:54:28,152 INFO L226 Difference]: Without dead ends: 1069 [2023-12-16 04:54:28,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7954 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5031, Invalid=16431, Unknown=0, NotChecked=0, Total=21462 [2023-12-16 04:54:28,157 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 619 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:28,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 89 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:54:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2023-12-16 04:54:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 828. [2023-12-16 04:54:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.192261185006046) internal successors, (986), 827 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 986 transitions. [2023-12-16 04:54:28,235 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 986 transitions. Word has length 141 [2023-12-16 04:54:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:28,235 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 986 transitions. [2023-12-16 04:54:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.12) internal successors, (234), 74 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 986 transitions. [2023-12-16 04:54:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:54:28,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:28,237 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:28,247 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-16 04:54:28,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:28,447 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:28,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -9335342, now seen corresponding path program 1 times [2023-12-16 04:54:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991896045] [2023-12-16 04:54:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2023-12-16 04:54:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991896045] [2023-12-16 04:54:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991896045] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065511248] [2023-12-16 04:54:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:28,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:28,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:28,585 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-16 04:54:28,609 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-16 04:54:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:28,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:54:28,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2023-12-16 04:54:28,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2023-12-16 04:54:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065511248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:29,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-12-16 04:54:29,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485178601] [2023-12-16 04:54:29,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:29,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:54:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:54:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:54:29,156 INFO L87 Difference]: Start difference. First operand 828 states and 986 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:29,359 INFO L93 Difference]: Finished difference Result 2538 states and 3078 transitions. [2023-12-16 04:54:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:54:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-16 04:54:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:29,362 INFO L225 Difference]: With dead ends: 2538 [2023-12-16 04:54:29,362 INFO L226 Difference]: Without dead ends: 1108 [2023-12-16 04:54:29,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:54:29,364 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 192 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:29,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 97 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:54:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2023-12-16 04:54:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1104. [2023-12-16 04:54:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 1.1514052583862193) internal successors, (1270), 1103 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1270 transitions. [2023-12-16 04:54:29,458 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1270 transitions. Word has length 141 [2023-12-16 04:54:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:29,459 INFO L495 AbstractCegarLoop]: Abstraction has 1104 states and 1270 transitions. [2023-12-16 04:54:29,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1270 transitions. [2023-12-16 04:54:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2023-12-16 04:54:29,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:29,464 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:29,469 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-16 04:54:29,669 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,SelfDestructingSolverStorable14 [2023-12-16 04:54:29,669 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:29,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2022989550, now seen corresponding path program 2 times [2023-12-16 04:54:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:29,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486107292] [2023-12-16 04:54:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2023-12-16 04:54:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486107292] [2023-12-16 04:54:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486107292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256485095] [2023-12-16 04:54:30,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:54:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:30,092 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-16 04:54:30,119 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-16 04:54:30,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:54:30,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:54:30,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 04:54:30,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2023-12-16 04:54:31,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2023-12-16 04:54:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256485095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:31,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2023-12-16 04:54:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801674147] [2023-12-16 04:54:31,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:31,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-16 04:54:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-16 04:54:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2023-12-16 04:54:31,739 INFO L87 Difference]: Start difference. First operand 1104 states and 1270 transitions. Second operand has 25 states, 25 states have (on average 8.68) internal successors, (217), 24 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:32,112 INFO L93 Difference]: Finished difference Result 4178 states and 5030 transitions. [2023-12-16 04:54:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:54:32,112 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.68) internal successors, (217), 24 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 417 [2023-12-16 04:54:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:32,116 INFO L225 Difference]: With dead ends: 4178 [2023-12-16 04:54:32,116 INFO L226 Difference]: Without dead ends: 1664 [2023-12-16 04:54:32,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2023-12-16 04:54:32,121 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 212 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:32,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 188 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2023-12-16 04:54:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1656. [2023-12-16 04:54:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.1105740181268882) internal successors, (1838), 1655 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1838 transitions. [2023-12-16 04:54:32,222 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1838 transitions. Word has length 417 [2023-12-16 04:54:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:32,223 INFO L495 AbstractCegarLoop]: Abstraction has 1656 states and 1838 transitions. [2023-12-16 04:54:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.68) internal successors, (217), 24 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1838 transitions. [2023-12-16 04:54:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2023-12-16 04:54:32,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:32,249 INFO L195 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:32,280 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-16 04:54:32,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-16 04:54:32,464 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:32,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1722194030, now seen corresponding path program 3 times [2023-12-16 04:54:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:32,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844007384] [2023-12-16 04:54:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:54:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2023-12-16 04:54:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:54:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844007384] [2023-12-16 04:54:33,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844007384] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:54:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77188924] [2023-12-16 04:54:33,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:54:33,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:54:33,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:54:33,869 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-16 04:54:33,897 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-16 04:54:34,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2023-12-16 04:54:34,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:54:34,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:54:34,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:54:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2023-12-16 04:54:36,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:54:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2023-12-16 04:54:37,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77188924] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:54:37,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:54:37,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2023-12-16 04:54:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294968466] [2023-12-16 04:54:37,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:54:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-16 04:54:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:54:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-16 04:54:37,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 04:54:37,691 INFO L87 Difference]: Start difference. First operand 1656 states and 1838 transitions. Second operand has 39 states, 39 states have (on average 10.282051282051283) internal successors, (401), 38 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:54:38,167 INFO L93 Difference]: Finished difference Result 4048 states and 4764 transitions. [2023-12-16 04:54:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:54:38,168 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.282051282051283) internal successors, (401), 38 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 969 [2023-12-16 04:54:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:54:38,173 INFO L225 Difference]: With dead ends: 4048 [2023-12-16 04:54:38,173 INFO L226 Difference]: Without dead ends: 2076 [2023-12-16 04:54:38,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1958 GetRequests, 1906 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2023-12-16 04:54:38,176 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 323 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:54:38,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 259 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:54:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2023-12-16 04:54:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2070. [2023-12-16 04:54:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2069 states have (on average 1.0942484291928467) internal successors, (2264), 2069 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2264 transitions. [2023-12-16 04:54:38,284 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2264 transitions. Word has length 969 [2023-12-16 04:54:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:54:38,285 INFO L495 AbstractCegarLoop]: Abstraction has 2070 states and 2264 transitions. [2023-12-16 04:54:38,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.282051282051283) internal successors, (401), 38 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:54:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2264 transitions. [2023-12-16 04:54:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1384 [2023-12-16 04:54:38,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:54:38,300 INFO L195 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:38,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-16 04:54:38,503 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,SelfDestructingSolverStorable16 [2023-12-16 04:54:38,504 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:54:38,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:54:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1198598258, now seen corresponding path program 4 times [2023-12-16 04:54:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:54:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284061052] [2023-12-16 04:54:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:54:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:54:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:54:38,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:54:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:54:39,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:54:39,493 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:54:39,494 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:54:39,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:54:39,500 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:54:39,505 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:54:39,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:54:39 BoogieIcfgContainer [2023-12-16 04:54:39,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:54:39,777 INFO L158 Benchmark]: Toolchain (without parser) took 33508.74ms. Allocated memory was 205.5MB in the beginning and 687.9MB in the end (delta: 482.3MB). Free memory was 150.7MB in the beginning and 642.1MB in the end (delta: -491.4MB). Peak memory consumption was 322.7MB. Max. memory is 8.0GB. [2023-12-16 04:54:39,778 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:54:39,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.08ms. Allocated memory is still 205.5MB. Free memory was 150.2MB in the beginning and 139.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 04:54:39,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.62ms. Allocated memory is still 205.5MB. Free memory was 139.1MB in the beginning and 137.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 04:54:39,779 INFO L158 Benchmark]: Boogie Preprocessor took 25.32ms. Allocated memory is still 205.5MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:54:39,779 INFO L158 Benchmark]: RCFGBuilder took 236.78ms. Allocated memory is still 205.5MB. Free memory was 136.0MB in the beginning and 124.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 04:54:39,780 INFO L158 Benchmark]: TraceAbstraction took 32996.33ms. Allocated memory was 205.5MB in the beginning and 687.9MB in the end (delta: 482.3MB). Free memory was 124.0MB in the beginning and 642.1MB in the end (delta: -518.1MB). Peak memory consumption was 296.5MB. Max. memory is 8.0GB. [2023-12-16 04:54:39,783 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.11ms. Allocated memory is still 205.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.08ms. Allocated memory is still 205.5MB. Free memory was 150.2MB in the beginning and 139.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.62ms. Allocated memory is still 205.5MB. Free memory was 139.1MB in the beginning and 137.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.32ms. Allocated memory is still 205.5MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 236.78ms. Allocated memory is still 205.5MB. Free memory was 136.0MB in the beginning and 124.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32996.33ms. Allocated memory was 205.5MB in the beginning and 687.9MB in the end (delta: 482.3MB). Free memory was 124.0MB in the beginning and 642.1MB in the end (delta: -518.1MB). Peak memory consumption was 296.5MB. 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: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L21] RET assume_abort_if_not(last > 0) [L22] int a=0,b=0,c=0,st=0,d=0; VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=0, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=1, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=1, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=2, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=2, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=3, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=3, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=4, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=4, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=5, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=5, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=6, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=6, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=7, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=7, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=8, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=8, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=9, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=9, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=10, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=10, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=11, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=11, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=12, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=12, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=13, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=13, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=14, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=14, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=15, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=15, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=16, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=16, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=17, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=17, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=18, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=18, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=19, d=0, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=0, b=0, c=19, d=0, last=21, st=1] [L25] c++ VAL [SIZE=20, a=0, b=0, c=20, d=0, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=2, b=2, c=0, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=0, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=1, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=1, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=2, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=2, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=3, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=3, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=4, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=4, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=5, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=5, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=6, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=6, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=7, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=7, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=8, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=8, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=9, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=9, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=10, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=10, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=11, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=11, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=12, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=12, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=13, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=13, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=14, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=14, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=15, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=15, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=16, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=16, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=17, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=17, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=18, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=18, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=19, d=1, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=2, b=2, c=19, d=1, last=21, st=1] [L25] c++ VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=4, b=4, c=0, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=0, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=1, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=1, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=2, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=2, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=3, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=3, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=4, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=4, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=5, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=5, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=6, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=6, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=7, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=7, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=8, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=8, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=9, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=9, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=10, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=10, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=11, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=11, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=12, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=12, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=13, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=13, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=14, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=14, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=15, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=15, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=16, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=16, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=17, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=17, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=18, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=18, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=19, d=2, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=4, b=4, c=19, d=2, last=21, st=1] [L25] c++ VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=6, b=6, c=0, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=0, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=1, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=1, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=2, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=2, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=3, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=3, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=4, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=4, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=5, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=5, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=6, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=6, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=7, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=7, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=8, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=8, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=9, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=9, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=10, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=10, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=11, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=11, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=12, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=12, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=13, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=13, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=14, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=14, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=15, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=15, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=16, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=16, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=17, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=17, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=18, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=18, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=19, d=3, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=6, b=6, c=19, d=3, last=21, st=1] [L25] c++ VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=8, b=8, c=0, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=0, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=1, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=1, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=2, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=2, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=3, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=3, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=4, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=4, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=5, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=5, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=6, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=6, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=7, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=7, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=8, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=8, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=9, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=9, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=10, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=10, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=11, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=11, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=12, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=12, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=13, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=13, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=14, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=14, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=15, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=15, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=16, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=16, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=17, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=17, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=18, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=18, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=19, d=4, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=8, b=8, c=19, d=4, last=21, st=1] [L25] c++ VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=10, b=10, c=0, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=0, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=1, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=1, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=2, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=2, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=3, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=3, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=4, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=4, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=5, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=5, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=6, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=6, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=7, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=7, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=8, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=8, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=9, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=9, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=10, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=10, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=11, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=11, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=12, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=12, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=13, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=13, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=14, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=14, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=15, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=15, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=16, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=16, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=17, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=17, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=18, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=18, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=19, d=5, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=10, b=10, c=19, d=5, last=21, st=1] [L25] c++ VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=12, b=12, c=0, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=0, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=1, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=1, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=2, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=2, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=3, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=3, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=4, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=4, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=5, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=5, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=6, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=6, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=7, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=7, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=8, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=8, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=9, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=9, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=10, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=10, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=11, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=11, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=12, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=12, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=13, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=13, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=14, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=14, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=15, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=15, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=16, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=16, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=17, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=17, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=18, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=18, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=19, d=6, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=12, b=12, c=19, d=6, last=21, st=1] [L25] c++ VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=14, b=14, c=0, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=0, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=1, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=1, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=2, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=2, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=3, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=3, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=4, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=4, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=5, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=5, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=6, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=6, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=7, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=7, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=8, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=8, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=9, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=9, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=10, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=10, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=11, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=11, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=12, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=12, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=13, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=13, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=14, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=14, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=15, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=15, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=16, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=16, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=17, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=17, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=18, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=18, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=19, d=7, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=14, b=14, c=19, d=7, last=21, st=1] [L25] c++ VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=16, b=16, c=0, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=0, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=1, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=1, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=2, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=2, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=3, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=3, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=4, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=4, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=5, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=5, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=6, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=6, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=7, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=7, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=8, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=8, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=9, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=9, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=10, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=10, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=11, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=11, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=12, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=12, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=13, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=13, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=14, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=14, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=15, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=15, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=16, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=16, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=17, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=17, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=18, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=18, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=19, d=8, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=16, b=16, c=19, d=8, last=21, st=1] [L25] c++ VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=18, b=18, c=0, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=0, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=1, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=1, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=2, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=2, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=3, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=3, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=4, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=4, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=5, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=5, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=6, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=6, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=7, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=7, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=8, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=8, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=9, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=9, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=10, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=10, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=11, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=11, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=12, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=12, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=13, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=13, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=14, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=14, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=15, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=15, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=16, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=16, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=17, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=17, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=18, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=18, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=19, d=9, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=18, b=18, c=19, d=9, last=21, st=1] [L25] c++ VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=20, b=20, c=0, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=0, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=1, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=1, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=2, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=2, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=3, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=3, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=4, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=4, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=5, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=5, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=6, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=6, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=7, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=7, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=8, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=8, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=9, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=9, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=10, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=10, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=11, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=11, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=12, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=12, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=13, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=13, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=14, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=14, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=15, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=15, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=16, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=16, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=17, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=17, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=18, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=18, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=19, d=10, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=20, b=20, c=19, d=10, last=21, st=1] [L25] c++ VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=22, b=22, c=0, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=0, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=1, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=1, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=2, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=2, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=3, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=3, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=4, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=4, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=5, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=5, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=6, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=6, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=7, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=7, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=8, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=8, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=9, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=9, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=10, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=10, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=11, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=11, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=12, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=12, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=13, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=13, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=14, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=14, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=15, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=15, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=16, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=16, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=17, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=17, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=18, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=18, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=19, d=11, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=22, b=22, c=19, d=11, last=21, st=1] [L25] c++ VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=24, b=24, c=0, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=0, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=1, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=1, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=2, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=2, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=3, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=3, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=4, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=4, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=5, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=5, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=6, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=6, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=7, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=7, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=8, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=8, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=9, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=9, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=10, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=10, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=11, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=11, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=12, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=12, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=13, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=13, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=14, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=14, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=15, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=15, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=16, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=16, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=17, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=17, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=18, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=18, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=19, d=12, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=24, b=24, c=19, d=12, last=21, st=1] [L25] c++ VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=26, b=26, c=0, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=0, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=1, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=1, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=2, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=2, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=3, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=3, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=4, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=4, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=5, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=5, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=6, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=6, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=7, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=7, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=8, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=8, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=9, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=9, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=10, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=10, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=11, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=11, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=12, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=12, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=13, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=13, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=14, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=14, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=15, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=15, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=16, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=16, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=17, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=17, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=18, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=18, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=19, d=13, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=26, b=26, c=19, d=13, last=21, st=1] [L25] c++ VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=28, b=28, c=0, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=0, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=1, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=1, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=2, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=2, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=3, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=3, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=4, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=4, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=5, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=5, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=6, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=6, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=7, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=7, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=8, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=8, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=9, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=9, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=10, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=10, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=11, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=11, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=12, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=12, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=13, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=13, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=14, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=14, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=15, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=15, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=16, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=16, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=17, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=17, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=18, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=18, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=19, d=14, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=28, b=28, c=19, d=14, last=21, st=1] [L25] c++ VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=30, b=30, c=0, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=0, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=1, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=1, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=2, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=2, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=3, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=3, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=4, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=4, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=5, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=5, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=6, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=6, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=7, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=7, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=8, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=8, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=9, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=9, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=10, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=10, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=11, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=11, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=12, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=12, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=13, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=13, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=14, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=14, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=15, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=15, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=16, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=16, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=17, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=17, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=18, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=18, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=19, d=15, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=30, b=30, c=19, d=15, last=21, st=1] [L25] c++ VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=32, b=32, c=0, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=0, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=1, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=1, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=2, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=2, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=3, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=3, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=4, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=4, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=5, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=5, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=6, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=6, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=7, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=7, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=8, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=8, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=9, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=9, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=10, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=10, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=11, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=11, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=12, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=12, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=13, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=13, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=14, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=14, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=15, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=15, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=16, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=16, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=17, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=17, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=18, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=18, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=19, d=16, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=32, b=32, c=19, d=16, last=21, st=1] [L25] c++ VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=34, b=34, c=0, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=0, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=1, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=1, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=2, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=2, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=3, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=3, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=4, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=4, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=5, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=5, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=6, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=6, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=7, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=7, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=8, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=8, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=9, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=9, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=10, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=10, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=11, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=11, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=12, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=12, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=13, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=13, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=14, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=14, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=15, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=15, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=16, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=16, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=17, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=17, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=18, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=18, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=19, d=17, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=34, b=34, c=19, d=17, last=21, st=1] [L25] c++ VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=36, b=36, c=0, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=0, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=1, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=1, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=2, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=2, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=3, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=3, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=4, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=4, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=5, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=5, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=6, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=6, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=7, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=7, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=8, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=8, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=9, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=9, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=10, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=10, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=11, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=11, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=12, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=12, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=13, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=13, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=14, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=14, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=15, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=15, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=16, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=16, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=17, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=17, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=18, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=18, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=19, d=18, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=36, b=36, c=19, d=18, last=21, st=1] [L25] c++ VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21, st=1] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, \old(cond)=1, cond=1, last=21] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [SIZE=20, a=38, b=38, c=0, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=0, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=1, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=1, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=2, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=2, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=3, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=3, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=4, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=4, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=5, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=5, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=6, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=6, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=7, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=7, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=8, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=8, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=9, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=9, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=10, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=10, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=11, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=11, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=12, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=12, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=13, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=13, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=14, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=14, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=15, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=15, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=16, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=16, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=17, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=17, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=18, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=18, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=19, d=19, last=21, st=1] [L25] COND TRUE c=last) VAL [SIZE=20, a=38, b=38, c=19, d=19, last=21, st=1] [L25] c++ VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [SIZE=20, a=40, b=40, c=20, d=20, last=21, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [SIZE=20, a=0, b=1, c=20, d=20, last=21, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [SIZE=20, \old(cond)=0, cond=0, last=21] [L12] reach_error() VAL [SIZE=20, \old(cond)=0, cond=0, last=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3353 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3353 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1038 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2754 IncrementalHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 247 mSDtfsCounter, 2754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4212 GetRequests, 3589 SyntacticMatches, 22 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26150 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2070occurred in iteration=17, InterpolantAutomatonStates: 416, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 2791 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 5472 NumberOfCodeBlocks, 5418 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 5914 ConstructedInterpolants, 0 QuantifiedInterpolants, 37171 SizeOfPredicates, 38 NumberOfNonLiveVariables, 3338 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 42678/452362 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-16 04:54:39,807 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...