./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:24:08,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:24:08,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:24:08,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:24:08,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:24:08,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:24:08,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:24:08,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:24:08,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:24:08,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:24:08,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:24:08,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:24:08,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:24:08,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:24:08,926 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:24:08,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:24:08,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:24:08,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:24:08,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:24:08,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:24:08,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:24:08,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:24:08,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:24:08,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:24:08,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:24:08,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:24:08,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:24:08,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:24:08,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:24:08,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:24:08,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:24:08,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:24:08,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:24:08,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:24:08,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:24:08,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:24:08,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:24:08,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:24:08,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:24:08,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:24:08,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:24:08,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:24:08,937 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a [2024-11-18 13:24:09,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:24:09,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:24:09,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:24:09,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:24:09,167 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:24:09,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2024-11-18 13:24:10,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:24:10,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:24:10,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2024-11-18 13:24:10,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be8e56ee/afd35583e5b44b62a10ff5a7d0b5ce6c/FLAG5f14beb1f [2024-11-18 13:24:10,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be8e56ee/afd35583e5b44b62a10ff5a7d0b5ce6c [2024-11-18 13:24:10,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:24:10,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:24:10,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:24:10,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:24:10,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:24:10,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277457a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10, skipping insertion in model container [2024-11-18 13:24:10,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:24:10,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2024-11-18 13:24:10,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:24:10,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:24:10,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2024-11-18 13:24:10,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:24:10,758 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:24:10,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10 WrapperNode [2024-11-18 13:24:10,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:24:10,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:24:10,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:24:10,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:24:10,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,784 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-18 13:24:10,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:24:10,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:24:10,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:24:10,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:24:10,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,804 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]. [2024-11-18 13:24:10,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:24:10,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:24:10,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:24:10,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:24:10,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (1/1) ... [2024-11-18 13:24:10,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:24:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:10,841 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) [2024-11-18 13:24:10,843 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 [2024-11-18 13:24:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:24:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:24:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:24:10,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:24:10,922 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:24:10,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:24:11,025 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-18 13:24:11,025 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:24:11,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:24:11,034 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 13:24:11,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:24:11 BoogieIcfgContainer [2024-11-18 13:24:11,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:24:11,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:24:11,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:24:11,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:24:11,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:24:10" (1/3) ... [2024-11-18 13:24:11,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25136501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:24:11, skipping insertion in model container [2024-11-18 13:24:11,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:24:10" (2/3) ... [2024-11-18 13:24:11,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25136501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:24:11, skipping insertion in model container [2024-11-18 13:24:11,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:24:11" (3/3) ... [2024-11-18 13:24:11,040 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2024-11-18 13:24:11,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:24:11,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:24:11,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:24:11,096 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f831406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:24:11,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:24:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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) [2024-11-18 13:24:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 13:24:11,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:11,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:11,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:11,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:11,110 INFO L85 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2024-11-18 13:24:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758540313] [2024-11-18 13:24:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758540313] [2024-11-18 13:24:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758540313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:24:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790371834] [2024-11-18 13:24:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:24:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:24:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:24:11,256 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-18 13:24:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:11,265 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2024-11-18 13:24:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:24:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-18 13:24:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:11,271 INFO L225 Difference]: With dead ends: 35 [2024-11-18 13:24:11,271 INFO L226 Difference]: Without dead ends: 17 [2024-11-18 13:24:11,273 INFO L431 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 [2024-11-18 13:24:11,275 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:11,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-18 13:24:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-18 13:24:11,293 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) [2024-11-18 13:24:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-18 13:24:11,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2024-11-18 13:24:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:11,295 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-18 13:24:11,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-18 13:24:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2024-11-18 13:24:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 13:24:11,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:11,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:11,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:24:11,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2024-11-18 13:24:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021351830] [2024-11-18 13:24:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:11,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:11,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:11,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021351830] [2024-11-18 13:24:11,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021351830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:11,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:11,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:24:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628523383] [2024-11-18 13:24:11,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:11,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:24:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:24:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:24:11,428 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-18 13:24:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:11,484 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2024-11-18 13:24:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:24:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-18 13:24:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:11,486 INFO L225 Difference]: With dead ends: 33 [2024-11-18 13:24:11,487 INFO L226 Difference]: Without dead ends: 20 [2024-11-18 13:24:11,488 INFO L431 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 [2024-11-18 13:24:11,489 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:11,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-18 13:24:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-18 13:24:11,495 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) [2024-11-18 13:24:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-18 13:24:11,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2024-11-18 13:24:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:11,498 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-18 13:24:11,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-18 13:24:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-11-18 13:24:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:24:11,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:11,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:11,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:24:11,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:11,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2024-11-18 13:24:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498135992] [2024-11-18 13:24:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:24:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498135992] [2024-11-18 13:24:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498135992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:24:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230056609] [2024-11-18 13:24:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:24:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:24:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:24:11,584 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-18 13:24:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:11,616 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2024-11-18 13:24:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:24:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 15 [2024-11-18 13:24:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:11,617 INFO L225 Difference]: With dead ends: 36 [2024-11-18 13:24:11,617 INFO L226 Difference]: Without dead ends: 22 [2024-11-18 13:24:11,617 INFO L431 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 [2024-11-18 13:24:11,618 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:11,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-18 13:24:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-18 13:24:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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) [2024-11-18 13:24:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-18 13:24:11,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2024-11-18 13:24:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-18 13:24:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-18 13:24:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-18 13:24:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:24:11,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:11,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:11,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:24:11,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:11,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2024-11-18 13:24:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748657014] [2024-11-18 13:24:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:24:11,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:11,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748657014] [2024-11-18 13:24:11,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748657014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:24:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155301007] [2024-11-18 13:24:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:11,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:24:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:24:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:24:11,741 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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) [2024-11-18 13:24:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:11,769 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-11-18 13:24:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:24:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 15 [2024-11-18 13:24:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:11,771 INFO L225 Difference]: With dead ends: 49 [2024-11-18 13:24:11,771 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 13:24:11,772 INFO L431 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 [2024-11-18 13:24:11,774 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 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.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:11,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 13:24:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-18 13:24:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 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) [2024-11-18 13:24:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-11-18 13:24:11,781 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2024-11-18 13:24:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-11-18 13:24:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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) [2024-11-18 13:24:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2024-11-18 13:24:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:24:11,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:11,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:11,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:24:11,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:11,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2024-11-18 13:24:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:11,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24798063] [2024-11-18 13:24:11,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:11,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24798063] [2024-11-18 13:24:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24798063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386169917] [2024-11-18 13:24:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:11,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:11,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:11,851 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) [2024-11-18 13:24:11,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:24:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:11,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 13:24:11,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:11,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386169917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:11,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-18 13:24:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764110700] [2024-11-18 13:24:11,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:11,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:24:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:24:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:24:11,999 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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) [2024-11-18 13:24:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:12,077 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2024-11-18 13:24:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 13:24:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 15 [2024-11-18 13:24:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:12,080 INFO L225 Difference]: With dead ends: 78 [2024-11-18 13:24:12,080 INFO L226 Difference]: Without dead ends: 50 [2024-11-18 13:24:12,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-18 13:24:12,081 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:12,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 37 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-18 13:24:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-18 13:24:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 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) [2024-11-18 13:24:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-11-18 13:24:12,091 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2024-11-18 13:24:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:12,091 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-11-18 13:24:12,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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) [2024-11-18 13:24:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-18 13:24:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:24:12,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:12,093 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:12,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 13:24:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:12,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -901646477, now seen corresponding path program 2 times [2024-11-18 13:24:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287689628] [2024-11-18 13:24:12,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:24:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:12,305 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:24:12,305 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 13:24:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287689628] [2024-11-18 13:24:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287689628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946962292] [2024-11-18 13:24:12,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:24:12,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:12,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:12,403 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) [2024-11-18 13:24:12,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:24:12,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:24:12,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:12,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:24:12,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 13:24:12,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 13:24:12,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946962292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:12,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:12,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-18 13:24:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321980391] [2024-11-18 13:24:12,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:12,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 13:24:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:12,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 13:24:12,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:24:12,637 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 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) [2024-11-18 13:24:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:12,881 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2024-11-18 13:24:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 13:24:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 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 24 [2024-11-18 13:24:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:12,883 INFO L225 Difference]: With dead ends: 192 [2024-11-18 13:24:12,883 INFO L226 Difference]: Without dead ends: 146 [2024-11-18 13:24:12,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2024-11-18 13:24:12,884 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 114 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:12,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 61 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-18 13:24:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2024-11-18 13:24:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 133 states have internal predecessors, (172), 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) [2024-11-18 13:24:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2024-11-18 13:24:12,902 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 24 [2024-11-18 13:24:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2024-11-18 13:24:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 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) [2024-11-18 13:24:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2024-11-18 13:24:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:24:12,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:12,905 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:12,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:24:13,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 13:24:13,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1057536243, now seen corresponding path program 1 times [2024-11-18 13:24:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174451590] [2024-11-18 13:24:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-18 13:24:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174451590] [2024-11-18 13:24:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174451590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:13,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:13,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:24:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991419908] [2024-11-18 13:24:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:13,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:24:13,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:13,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:24:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:24:13,149 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-18 13:24:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:13,174 INFO L93 Difference]: Finished difference Result 284 states and 368 transitions. [2024-11-18 13:24:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:24:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 24 [2024-11-18 13:24:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:13,176 INFO L225 Difference]: With dead ends: 284 [2024-11-18 13:24:13,176 INFO L226 Difference]: Without dead ends: 154 [2024-11-18 13:24:13,177 INFO L431 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 [2024-11-18 13:24:13,177 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 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 [2024-11-18 13:24:13,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-18 13:24:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2024-11-18 13:24:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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) [2024-11-18 13:24:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2024-11-18 13:24:13,193 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 24 [2024-11-18 13:24:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:13,193 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2024-11-18 13:24:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-18 13:24:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2024-11-18 13:24:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 13:24:13,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:13,194 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:13,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 13:24:13,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:13,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2129582297, now seen corresponding path program 1 times [2024-11-18 13:24:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:13,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576527601] [2024-11-18 13:24:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576527601] [2024-11-18 13:24:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576527601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617429706] [2024-11-18 13:24:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:13,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:13,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:13,269 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) [2024-11-18 13:24:13,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:24:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:13,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 13:24:13,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:13,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617429706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:13,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-18 13:24:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111182040] [2024-11-18 13:24:13,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:13,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 13:24:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 13:24:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-18 13:24:13,474 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 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) [2024-11-18 13:24:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:13,619 INFO L93 Difference]: Finished difference Result 440 states and 604 transitions. [2024-11-18 13:24:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:24:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 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 25 [2024-11-18 13:24:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:13,623 INFO L225 Difference]: With dead ends: 440 [2024-11-18 13:24:13,623 INFO L226 Difference]: Without dead ends: 294 [2024-11-18 13:24:13,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-11-18 13:24:13,624 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:13,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 30 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-18 13:24:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-18 13:24:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.2627986348122866) internal successors, (370), 293 states have internal predecessors, (370), 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) [2024-11-18 13:24:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 370 transitions. [2024-11-18 13:24:13,646 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 370 transitions. Word has length 25 [2024-11-18 13:24:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:13,646 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 370 transitions. [2024-11-18 13:24:13,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 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) [2024-11-18 13:24:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 370 transitions. [2024-11-18 13:24:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 13:24:13,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:13,647 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:13,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 13:24:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:13,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1593832537, now seen corresponding path program 2 times [2024-11-18 13:24:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507565336] [2024-11-18 13:24:13,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:24:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:13,859 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:24:13,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507565336] [2024-11-18 13:24:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507565336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994752846] [2024-11-18 13:24:14,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:24:14,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:14,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:14,007 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) [2024-11-18 13:24:14,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:24:14,052 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:24:14,052 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:14,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 13:24:14,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:14,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994752846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:14,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:14,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-11-18 13:24:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293994221] [2024-11-18 13:24:14,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:14,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-18 13:24:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:14,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-18 13:24:14,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=678, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 13:24:14,429 INFO L87 Difference]: Start difference. First operand 294 states and 370 transitions. Second operand has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 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) [2024-11-18 13:24:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:14,713 INFO L93 Difference]: Finished difference Result 824 states and 1116 transitions. [2024-11-18 13:24:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 13:24:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 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 43 [2024-11-18 13:24:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:14,718 INFO L225 Difference]: With dead ends: 824 [2024-11-18 13:24:14,718 INFO L226 Difference]: Without dead ends: 534 [2024-11-18 13:24:14,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-11-18 13:24:14,722 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:14,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 42 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-18 13:24:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2024-11-18 13:24:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.2570356472795496) internal successors, (670), 533 states have internal predecessors, (670), 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) [2024-11-18 13:24:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 670 transitions. [2024-11-18 13:24:14,752 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 670 transitions. Word has length 43 [2024-11-18 13:24:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:14,752 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 670 transitions. [2024-11-18 13:24:14,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 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) [2024-11-18 13:24:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 670 transitions. [2024-11-18 13:24:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 13:24:14,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:14,754 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:14,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 13:24:14,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:14,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:14,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1639992537, now seen corresponding path program 3 times [2024-11-18 13:24:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:14,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969152425] [2024-11-18 13:24:14,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:24:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:14,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:24:14,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-18 13:24:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969152425] [2024-11-18 13:24:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969152425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:15,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:24:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480214261] [2024-11-18 13:24:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:24:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:24:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:24:15,010 INFO L87 Difference]: Start difference. First operand 534 states and 670 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2024-11-18 13:24:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:15,044 INFO L93 Difference]: Finished difference Result 536 states and 671 transitions. [2024-11-18 13:24:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:24:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 73 [2024-11-18 13:24:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:15,046 INFO L225 Difference]: With dead ends: 536 [2024-11-18 13:24:15,046 INFO L226 Difference]: Without dead ends: 396 [2024-11-18 13:24:15,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:24:15,047 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:15,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-18 13:24:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-18 13:24:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3240506329113924) internal successors, (523), 395 states have internal predecessors, (523), 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) [2024-11-18 13:24:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 523 transitions. [2024-11-18 13:24:15,062 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 523 transitions. Word has length 73 [2024-11-18 13:24:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:15,062 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 523 transitions. [2024-11-18 13:24:15,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2024-11-18 13:24:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2024-11-18 13:24:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 13:24:15,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:15,064 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:15,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 13:24:15,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:15,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash -336186329, now seen corresponding path program 1 times [2024-11-18 13:24:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069780329] [2024-11-18 13:24:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:24:15,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069780329] [2024-11-18 13:24:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069780329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:15,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-18 13:24:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486540035] [2024-11-18 13:24:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:15,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-18 13:24:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:15,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-18 13:24:15,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-18 13:24:15,405 INFO L87 Difference]: Start difference. First operand 396 states and 523 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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) [2024-11-18 13:24:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:15,654 INFO L93 Difference]: Finished difference Result 1832 states and 2440 transitions. [2024-11-18 13:24:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 13:24:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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 73 [2024-11-18 13:24:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:15,660 INFO L225 Difference]: With dead ends: 1832 [2024-11-18 13:24:15,660 INFO L226 Difference]: Without dead ends: 1578 [2024-11-18 13:24:15,661 INFO L431 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 [2024-11-18 13:24:15,662 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 307 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:15,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 82 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:24:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-18 13:24:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 400. [2024-11-18 13:24:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.2355889724310778) internal successors, (493), 399 states have internal predecessors, (493), 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) [2024-11-18 13:24:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2024-11-18 13:24:15,713 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 73 [2024-11-18 13:24:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:15,713 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2024-11-18 13:24:15,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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) [2024-11-18 13:24:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2024-11-18 13:24:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 13:24:15,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:15,716 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 13:24:15,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1438821033, now seen corresponding path program 1 times [2024-11-18 13:24:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:15,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499635867] [2024-11-18 13:24:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499635867] [2024-11-18 13:24:16,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499635867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003706612] [2024-11-18 13:24:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:16,348 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) [2024-11-18 13:24:16,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:24:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:16,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-18 13:24:16,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:17,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:24:18,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003706612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:18,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:18,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2024-11-18 13:24:18,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351323865] [2024-11-18 13:24:18,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:18,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-18 13:24:18,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:18,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-18 13:24:18,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1574, Invalid=3828, Unknown=0, NotChecked=0, Total=5402 [2024-11-18 13:24:18,198 INFO L87 Difference]: Start difference. First operand 400 states and 493 transitions. Second operand has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 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) [2024-11-18 13:24:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:19,793 INFO L93 Difference]: Finished difference Result 798 states and 990 transitions. [2024-11-18 13:24:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-18 13:24:19,794 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 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 73 [2024-11-18 13:24:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:19,796 INFO L225 Difference]: With dead ends: 798 [2024-11-18 13:24:19,796 INFO L226 Difference]: Without dead ends: 796 [2024-11-18 13:24:19,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5713 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3429, Invalid=11091, Unknown=0, NotChecked=0, Total=14520 [2024-11-18 13:24:19,799 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 369 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:19,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 79 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:24:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-18 13:24:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 765. [2024-11-18 13:24:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.2382198952879582) internal successors, (946), 764 states have internal predecessors, (946), 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) [2024-11-18 13:24:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 946 transitions. [2024-11-18 13:24:19,848 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 946 transitions. Word has length 73 [2024-11-18 13:24:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 946 transitions. [2024-11-18 13:24:19,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.7837837837837838) internal successors, (206), 73 states have internal predecessors, (206), 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) [2024-11-18 13:24:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 946 transitions. [2024-11-18 13:24:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 13:24:19,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:19,850 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:19,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 13:24:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-18 13:24:20,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1623737319, now seen corresponding path program 1 times [2024-11-18 13:24:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973503724] [2024-11-18 13:24:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-18 13:24:20,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:20,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973503724] [2024-11-18 13:24:20,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973503724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:20,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:24:20,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:24:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364744253] [2024-11-18 13:24:20,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:20,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:24:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:24:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:24:20,129 INFO L87 Difference]: Start difference. First operand 765 states and 946 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-18 13:24:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:20,233 INFO L93 Difference]: Finished difference Result 1189 states and 1473 transitions. [2024-11-18 13:24:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:24:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 73 [2024-11-18 13:24:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:20,236 INFO L225 Difference]: With dead ends: 1189 [2024-11-18 13:24:20,236 INFO L226 Difference]: Without dead ends: 990 [2024-11-18 13:24:20,237 INFO L431 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 [2024-11-18 13:24:20,237 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:20,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-18 13:24:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 843. [2024-11-18 13:24:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.2458432304038005) internal successors, (1049), 842 states have internal predecessors, (1049), 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) [2024-11-18 13:24:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1049 transitions. [2024-11-18 13:24:20,287 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1049 transitions. Word has length 73 [2024-11-18 13:24:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1049 transitions. [2024-11-18 13:24:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-18 13:24:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1049 transitions. [2024-11-18 13:24:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-18 13:24:20,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:20,289 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:20,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 13:24:20,289 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:20,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:20,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2032536794, now seen corresponding path program 1 times [2024-11-18 13:24:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015400810] [2024-11-18 13:24:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2024-11-18 13:24:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015400810] [2024-11-18 13:24:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015400810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403290075] [2024-11-18 13:24:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:20,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:20,409 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) [2024-11-18 13:24:20,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 13:24:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:20,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:24:20,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2024-11-18 13:24:20,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2024-11-18 13:24:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403290075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:20,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-18 13:24:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330878353] [2024-11-18 13:24:20,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:20,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 13:24:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 13:24:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2024-11-18 13:24:20,919 INFO L87 Difference]: Start difference. First operand 843 states and 1049 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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) [2024-11-18 13:24:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:21,089 INFO L93 Difference]: Finished difference Result 2081 states and 2589 transitions. [2024-11-18 13:24:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:24:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 142 [2024-11-18 13:24:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:21,095 INFO L225 Difference]: With dead ends: 2081 [2024-11-18 13:24:21,095 INFO L226 Difference]: Without dead ends: 1882 [2024-11-18 13:24:21,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:24:21,096 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 274 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:21,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 84 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:24:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-18 13:24:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1155. [2024-11-18 13:24:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2660311958405546) internal successors, (1461), 1154 states have internal predecessors, (1461), 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) [2024-11-18 13:24:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1461 transitions. [2024-11-18 13:24:21,169 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1461 transitions. Word has length 142 [2024-11-18 13:24:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:21,169 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1461 transitions. [2024-11-18 13:24:21,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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) [2024-11-18 13:24:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1461 transitions. [2024-11-18 13:24:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-18 13:24:21,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:21,170 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 39, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:21,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 13:24:21,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:21,371 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:21,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1816689998, now seen corresponding path program 1 times [2024-11-18 13:24:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:21,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692542978] [2024-11-18 13:24:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 721 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-11-18 13:24:21,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692542978] [2024-11-18 13:24:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692542978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042248788] [2024-11-18 13:24:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:24:21,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:21,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:21,821 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) [2024-11-18 13:24:21,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 13:24:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:24:21,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 13:24:21,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1959 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-11-18 13:24:22,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:24:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042248788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:24:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:24:22,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 44 [2024-11-18 13:24:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145835614] [2024-11-18 13:24:22,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:24:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-18 13:24:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-18 13:24:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 13:24:22,544 INFO L87 Difference]: Start difference. First operand 1155 states and 1461 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 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) [2024-11-18 13:24:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:22,737 INFO L93 Difference]: Finished difference Result 2101 states and 2653 transitions. [2024-11-18 13:24:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 13:24:22,738 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 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 145 [2024-11-18 13:24:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:22,741 INFO L225 Difference]: With dead ends: 2101 [2024-11-18 13:24:22,741 INFO L226 Difference]: Without dead ends: 876 [2024-11-18 13:24:22,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 13:24:22,744 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:22,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-18 13:24:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 810. [2024-11-18 13:24:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.1137206427688504) internal successors, (901), 809 states have internal predecessors, (901), 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) [2024-11-18 13:24:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 901 transitions. [2024-11-18 13:24:22,786 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 901 transitions. Word has length 145 [2024-11-18 13:24:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:22,786 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 901 transitions. [2024-11-18 13:24:22,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 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) [2024-11-18 13:24:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 901 transitions. [2024-11-18 13:24:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-11-18 13:24:22,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:22,797 INFO L215 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:22,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 13:24:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:22,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 449680486, now seen corresponding path program 2 times [2024-11-18 13:24:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198661245] [2024-11-18 13:24:22,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:24:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:23,052 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:24:23,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2024-11-18 13:24:23,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198661245] [2024-11-18 13:24:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198661245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:23,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125306067] [2024-11-18 13:24:23,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:24:23,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:23,340 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) [2024-11-18 13:24:23,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 13:24:23,453 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:24:23,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:23,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 13:24:23,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2024-11-18 13:24:24,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2024-11-18 13:24:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125306067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:24,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-18 13:24:24,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015298366] [2024-11-18 13:24:24,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:24,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-18 13:24:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-18 13:24:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2024-11-18 13:24:24,614 INFO L87 Difference]: Start difference. First operand 810 states and 901 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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) [2024-11-18 13:24:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:24,888 INFO L93 Difference]: Finished difference Result 2567 states and 3037 transitions. [2024-11-18 13:24:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 13:24:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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 418 [2024-11-18 13:24:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:24,892 INFO L225 Difference]: With dead ends: 2567 [2024-11-18 13:24:24,892 INFO L226 Difference]: Without dead ends: 1362 [2024-11-18 13:24:24,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2024-11-18 13:24:24,893 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 364 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:24,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 185 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-18 13:24:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2024-11-18 13:24:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 1.073475385745775) internal successors, (1461), 1361 states have internal predecessors, (1461), 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) [2024-11-18 13:24:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1461 transitions. [2024-11-18 13:24:24,957 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1461 transitions. Word has length 418 [2024-11-18 13:24:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:24,957 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1461 transitions. [2024-11-18 13:24:24,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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) [2024-11-18 13:24:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1461 transitions. [2024-11-18 13:24:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2024-11-18 13:24:24,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:24,974 INFO L215 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:24,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 13:24:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-18 13:24:25,179 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:25,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 133527270, now seen corresponding path program 3 times [2024-11-18 13:24:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548079731] [2024-11-18 13:24:25,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:24:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:25,448 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2024-11-18 13:24:25,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2024-11-18 13:24:26,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:24:26,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548079731] [2024-11-18 13:24:26,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548079731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:24:26,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831418589] [2024-11-18 13:24:26,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:24:26,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:24:26,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:24:26,458 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) [2024-11-18 13:24:26,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 13:24:27,104 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2024-11-18 13:24:27,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:24:27,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 13:24:27,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:24:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2024-11-18 13:24:28,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:24:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2024-11-18 13:24:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831418589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:24:29,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:24:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-11-18 13:24:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173815729] [2024-11-18 13:24:29,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:24:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-18 13:24:29,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:24:29,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-18 13:24:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2024-11-18 13:24:29,637 INFO L87 Difference]: Start difference. First operand 1362 states and 1461 transitions. Second operand has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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) [2024-11-18 13:24:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:24:30,015 INFO L93 Difference]: Finished difference Result 2729 states and 3123 transitions. [2024-11-18 13:24:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 13:24:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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 970 [2024-11-18 13:24:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:24:30,024 INFO L225 Difference]: With dead ends: 2729 [2024-11-18 13:24:30,025 INFO L226 Difference]: Without dead ends: 1776 [2024-11-18 13:24:30,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-11-18 13:24:30,028 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 259 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:24:30,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 214 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:24:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-18 13:24:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-18 13:24:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.059718309859155) internal successors, (1881), 1775 states have internal predecessors, (1881), 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) [2024-11-18 13:24:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1881 transitions. [2024-11-18 13:24:30,142 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1881 transitions. Word has length 970 [2024-11-18 13:24:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:24:30,143 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 1881 transitions. [2024-11-18 13:24:30,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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) [2024-11-18 13:24:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1881 transitions. [2024-11-18 13:24:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2024-11-18 13:24:30,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:24:30,152 INFO L215 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:30,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 13:24:30,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 13:24:30,352 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:24:30,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:24:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash 341765318, now seen corresponding path program 4 times [2024-11-18 13:24:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:24:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583889411] [2024-11-18 13:24:30,353 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 13:24:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:24:30,907 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 13:24:30,907 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 13:24:30,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 13:24:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 13:24:31,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 13:24:31,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 13:24:31,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 13:24:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 13:24:31,344 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:24:31,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 13:24:31,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:24:31 BoogieIcfgContainer [2024-11-18 13:24:31,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 13:24:31,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 13:24:31,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 13:24:31,565 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 13:24:31,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:24:11" (3/4) ... [2024-11-18 13:24:31,566 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 13:24:31,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 13:24:31,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 13:24:31,772 INFO L158 Benchmark]: Toolchain (without parser) took 21247.37ms. Allocated memory was 167.8MB in the beginning and 509.6MB in the end (delta: 341.8MB). Free memory was 139.2MB in the beginning and 251.7MB in the end (delta: -112.4MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,772 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 85.0MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 13:24:31,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.77ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 126.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.50ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 124.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,773 INFO L158 Benchmark]: Boogie Preprocessor took 29.96ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 123.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,773 INFO L158 Benchmark]: RCFGBuilder took 218.17ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 111.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,773 INFO L158 Benchmark]: TraceAbstraction took 20527.80ms. Allocated memory was 167.8MB in the beginning and 509.6MB in the end (delta: 341.8MB). Free memory was 110.7MB in the beginning and 314.1MB in the end (delta: -203.3MB). Peak memory consumption was 281.8MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,773 INFO L158 Benchmark]: Witness Printer took 206.28ms. Allocated memory is still 509.6MB. Free memory was 314.1MB in the beginning and 251.7MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-18 13:24:31,774 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.29ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 85.0MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.77ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 126.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.50ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 124.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.96ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 123.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 218.17ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 111.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20527.80ms. Allocated memory was 167.8MB in the beginning and 509.6MB in the end (delta: 341.8MB). Free memory was 110.7MB in the beginning and 314.1MB in the end (delta: -203.3MB). Peak memory consumption was 281.8MB. Max. memory is 16.1GB. * Witness Printer took 206.28ms. Allocated memory is still 509.6MB. Free memory was 314.1MB in the beginning and 251.7MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; VAL [SIZE=20, last=0] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [SIZE=20, 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, d=0, last=21] [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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=2, b=2, c=20, d=1, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=4, b=4, c=20, d=2, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=6, b=6, c=20, d=3, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=8, b=8, c=20, d=4, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=10, b=10, c=20, d=5, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=12, b=12, c=20, d=6, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=14, b=14, c=20, d=7, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=16, b=16, c=20, d=8, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=18, b=18, c=20, d=9, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=20, b=20, c=20, d=10, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=22, b=22, c=20, d=11, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=24, b=24, c=20, d=12, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=26, b=26, c=20, d=13, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=28, b=28, c=20, d=14, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=30, b=30, c=20, d=15, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=32, b=32, c=20, d=16, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=34, b=34, c=20, d=17, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=36, b=36, c=20, d=18, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND FALSE !(d == SIZE) VAL [SIZE=20, a=38, b=38, c=20, d=19, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [SIZE=20, 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] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [SIZE=20, a=0, b=1, c=20, d=20, last=21] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [SIZE=20, last=21] [L12] reach_error() VAL [SIZE=20, last=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2195 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2195 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 778 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1979 IncrementalHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 263 mSDtfsCounter, 1979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3795 GetRequests, 3404 SyntacticMatches, 14 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8369 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1776occurred in iteration=17, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2172 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 5391 NumberOfCodeBlocks, 5337 NumberOfCodeBlocksAsserted, 298 NumberOfCheckSat, 5683 ConstructedInterpolants, 0 QuantifiedInterpolants, 32327 SizeOfPredicates, 23 NumberOfNonLiveVariables, 3283 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 44752/449046 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! [2024-11-18 13:24:31,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE