./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-803cd42-m [2024-11-22 01:09:00,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 01:09:00,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 01:09:00,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 01:09:00,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 01:09:00,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 01:09:00,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 01:09:00,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 01:09:00,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 01:09:00,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 01:09:00,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 01:09:00,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 01:09:00,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 01:09:00,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 01:09:00,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 01:09:00,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 01:09:00,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 01:09:00,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 01:09:00,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 01:09:00,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 01:09:00,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 01:09:00,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 01:09:00,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 01:09:00,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 01:09:00,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 01:09:00,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 01:09:00,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 01:09:00,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 01:09:00,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 01:09:00,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 01:09:00,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 01:09:00,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 01:09:00,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:09:00,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 01:09:00,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 01:09:00,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 01:09:00,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 01:09:00,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 01:09:00,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 01:09:00,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 01:09:00,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 01:09:00,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 01:09:00,947 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-22 01:09:01,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 01:09:01,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 01:09:01,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 01:09:01,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 01:09:01,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 01:09:01,215 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-22 01:09:02,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 01:09:02,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 01:09:02,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2024-11-22 01:09:02,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbac7fc4/9c2bc614ac57487292225486cbf482f9/FLAGc7122a49c [2024-11-22 01:09:02,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbac7fc4/9c2bc614ac57487292225486cbf482f9 [2024-11-22 01:09:02,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 01:09:02,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 01:09:02,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 01:09:02,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 01:09:02,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 01:09:02,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:02" (1/1) ... [2024-11-22 01:09:02,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea7a106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:02, skipping insertion in model container [2024-11-22 01:09:02,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:02" (1/1) ... [2024-11-22 01:09:02,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 01:09:02,998 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-22 01:09:03,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:09:03,019 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 01:09:03,028 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-22 01:09:03,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 01:09:03,050 INFO L204 MainTranslator]: Completed translation [2024-11-22 01:09:03,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03 WrapperNode [2024-11-22 01:09:03,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 01:09:03,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 01:09:03,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 01:09:03,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 01:09:03,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,082 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-22 01:09:03,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 01:09:03,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 01:09:03,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 01:09:03,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 01:09:03,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,110 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-22 01:09:03,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 01:09:03,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 01:09:03,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 01:09:03,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 01:09:03,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (1/1) ... [2024-11-22 01:09:03,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 01:09:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:03,154 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-22 01:09:03,156 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-22 01:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 01:09:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 01:09:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 01:09:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 01:09:03,245 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 01:09:03,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 01:09:03,399 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-22 01:09:03,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 01:09:03,415 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 01:09:03,416 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 01:09:03,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:03 BoogieIcfgContainer [2024-11-22 01:09:03,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 01:09:03,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 01:09:03,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 01:09:03,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 01:09:03,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:09:02" (1/3) ... [2024-11-22 01:09:03,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7650c809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:03, skipping insertion in model container [2024-11-22 01:09:03,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:03" (2/3) ... [2024-11-22 01:09:03,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7650c809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:03, skipping insertion in model container [2024-11-22 01:09:03,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:03" (3/3) ... [2024-11-22 01:09:03,427 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2024-11-22 01:09:03,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 01:09:03,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 01:09:03,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 01:09:03,521 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;@f7350a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 01:09:03,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 01:09:03,525 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-22 01:09:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 01:09:03,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:03,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:03,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:03,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2024-11-22 01:09:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:03,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522762334] [2024-11-22 01:09:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:03,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:03,684 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-22 01:09:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522762334] [2024-11-22 01:09:03,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522762334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:03,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:03,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 01:09:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730528942] [2024-11-22 01:09:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:03,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 01:09:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 01:09:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 01:09:03,715 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-22 01:09:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:03,725 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2024-11-22 01:09:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 01:09:03,726 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-22 01:09:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:03,733 INFO L225 Difference]: With dead ends: 35 [2024-11-22 01:09:03,733 INFO L226 Difference]: Without dead ends: 17 [2024-11-22 01:09:03,735 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-22 01:09:03,739 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-22 01:09:03,740 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-22 01:09:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-22 01:09:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-22 01:09:03,761 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-22 01:09:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-22 01:09:03,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2024-11-22 01:09:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:03,764 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-22 01:09:03,764 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-22 01:09:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2024-11-22 01:09:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 01:09:03,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:03,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:03,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 01:09:03,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:03,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2024-11-22 01:09:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527942704] [2024-11-22 01:09:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:03,970 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-22 01:09:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527942704] [2024-11-22 01:09:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527942704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 01:09:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018404584] [2024-11-22 01:09:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 01:09:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:03,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 01:09:03,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:09:03,977 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-22 01:09:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:04,040 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2024-11-22 01:09:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 01:09:04,041 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-22 01:09:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:04,042 INFO L225 Difference]: With dead ends: 33 [2024-11-22 01:09:04,043 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 01:09:04,043 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-22 01:09:04,044 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:09:04,045 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.1s Time] [2024-11-22 01:09:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 01:09:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-22 01:09:04,052 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-22 01:09:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-22 01:09:04,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2024-11-22 01:09:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:04,054 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-22 01:09:04,055 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-22 01:09:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-11-22 01:09:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 01:09:04,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:04,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:04,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 01:09:04,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:04,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2024-11-22 01:09:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:04,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517815500] [2024-11-22 01:09:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:04,160 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-22 01:09:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517815500] [2024-11-22 01:09:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517815500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:04,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 01:09:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345660858] [2024-11-22 01:09:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 01:09:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 01:09:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 01:09:04,165 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-22 01:09:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:04,202 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2024-11-22 01:09:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 01:09:04,204 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-22 01:09:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:04,205 INFO L225 Difference]: With dead ends: 36 [2024-11-22 01:09:04,205 INFO L226 Difference]: Without dead ends: 22 [2024-11-22 01:09:04,205 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-22 01:09:04,206 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-22 01:09:04,207 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-22 01:09:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-22 01:09:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-22 01:09:04,213 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-22 01:09:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-22 01:09:04,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2024-11-22 01:09:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:04,214 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-22 01:09:04,215 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-22 01:09:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-22 01:09:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 01:09:04,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:04,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 01:09:04,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:04,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2024-11-22 01:09:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948738912] [2024-11-22 01:09:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:04,373 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-22 01:09:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948738912] [2024-11-22 01:09:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948738912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:04,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 01:09:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735583406] [2024-11-22 01:09:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:04,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 01:09:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 01:09:04,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 01:09:04,376 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-22 01:09:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:04,413 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-11-22 01:09:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 01:09:04,414 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-22 01:09:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:04,416 INFO L225 Difference]: With dead ends: 49 [2024-11-22 01:09:04,416 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 01:09:04,416 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-22 01:09:04,421 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-22 01:09:04,421 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-22 01:09:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 01:09:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-22 01:09:04,432 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-22 01:09:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-11-22 01:09:04,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2024-11-22 01:09:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:04,434 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-11-22 01:09:04,434 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-22 01:09:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2024-11-22 01:09:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 01:09:04,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:04,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:04,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 01:09:04,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2024-11-22 01:09:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56553613] [2024-11-22 01:09:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:04,516 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-22 01:09:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56553613] [2024-11-22 01:09:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56553613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569385091] [2024-11-22 01:09:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:04,521 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-22 01:09:04,523 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-22 01:09:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:04,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 01:09:04,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:04,684 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-22 01:09:04,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:04,736 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-22 01:09:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569385091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:04,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-22 01:09:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826482964] [2024-11-22 01:09:04,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:04,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 01:09:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:04,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 01:09:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-22 01:09:04,739 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-22 01:09:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:04,850 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2024-11-22 01:09:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 01:09:04,852 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-22 01:09:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:04,853 INFO L225 Difference]: With dead ends: 78 [2024-11-22 01:09:04,853 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 01:09:04,854 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-22 01:09:04,855 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 01:09:04,855 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-22 01:09:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 01:09:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-22 01:09:04,861 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-22 01:09:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-11-22 01:09:04,862 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2024-11-22 01:09:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:04,863 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-11-22 01:09:04,863 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-22 01:09:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-22 01:09:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 01:09:04,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:04,866 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:04,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 01:09:05,067 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-22 01:09:05,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:05,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash -901646477, now seen corresponding path program 2 times [2024-11-22 01:09:05,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:05,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578629984] [2024-11-22 01:09:05,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:09:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:05,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:09:05,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:05,195 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-22 01:09:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578629984] [2024-11-22 01:09:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578629984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148090077] [2024-11-22 01:09:05,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:09:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:05,197 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-22 01:09:05,198 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-22 01:09:05,234 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:09:05,235 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:05,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 01:09:05,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:05,368 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-22 01:09:05,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:05,455 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-22 01:09:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148090077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:05,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-22 01:09:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382342925] [2024-11-22 01:09:05,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 01:09:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:05,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 01:09:05,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-22 01:09:05,460 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-22 01:09:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:05,774 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2024-11-22 01:09:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 01:09:05,775 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-22 01:09:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:05,776 INFO L225 Difference]: With dead ends: 192 [2024-11-22 01:09:05,776 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 01:09:05,777 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-22 01:09:05,778 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-22 01:09:05,778 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-22 01:09:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 01:09:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2024-11-22 01:09:05,796 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-22 01:09:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2024-11-22 01:09:05,797 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 24 [2024-11-22 01:09:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:05,798 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2024-11-22 01:09:05,798 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-22 01:09:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2024-11-22 01:09:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 01:09:05,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:05,799 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:05,808 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-22 01:09:06,000 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-22 01:09:06,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1057536243, now seen corresponding path program 1 times [2024-11-22 01:09:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785183409] [2024-11-22 01:09:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:06,051 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-22 01:09:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785183409] [2024-11-22 01:09:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785183409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 01:09:06,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694973855] [2024-11-22 01:09:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 01:09:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:06,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 01:09:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 01:09:06,052 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-22 01:09:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:06,081 INFO L93 Difference]: Finished difference Result 284 states and 368 transitions. [2024-11-22 01:09:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 01:09:06,082 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-22 01:09:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:06,083 INFO L225 Difference]: With dead ends: 284 [2024-11-22 01:09:06,083 INFO L226 Difference]: Without dead ends: 154 [2024-11-22 01:09:06,083 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-22 01:09:06,084 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-22 01:09:06,084 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-22 01:09:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-22 01:09:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2024-11-22 01:09:06,104 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-22 01:09:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2024-11-22 01:09:06,105 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 24 [2024-11-22 01:09:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2024-11-22 01:09:06,105 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-22 01:09:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2024-11-22 01:09:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 01:09:06,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:06,106 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 01:09:06,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:06,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2129582297, now seen corresponding path program 1 times [2024-11-22 01:09:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:06,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456937347] [2024-11-22 01:09:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:06,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:06,209 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-22 01:09:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456937347] [2024-11-22 01:09:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456937347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89789657] [2024-11-22 01:09:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:06,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:06,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:06,213 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-22 01:09:06,215 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-22 01:09:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:06,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 01:09:06,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:06,365 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-22 01:09:06,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:06,465 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-22 01:09:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89789657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:06,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-22 01:09:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007284552] [2024-11-22 01:09:06,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:06,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 01:09:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:06,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 01:09:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-22 01:09:06,469 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-22 01:09:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:06,642 INFO L93 Difference]: Finished difference Result 440 states and 604 transitions. [2024-11-22 01:09:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 01:09:06,645 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-22 01:09:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:06,647 INFO L225 Difference]: With dead ends: 440 [2024-11-22 01:09:06,647 INFO L226 Difference]: Without dead ends: 294 [2024-11-22 01:09:06,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-11-22 01:09:06,649 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-22 01:09:06,649 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-22 01:09:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-22 01:09:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-22 01:09:06,690 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-22 01:09:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 370 transitions. [2024-11-22 01:09:06,696 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 370 transitions. Word has length 25 [2024-11-22 01:09:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 370 transitions. [2024-11-22 01:09:06,696 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-22 01:09:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 370 transitions. [2024-11-22 01:09:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 01:09:06,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:06,699 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:06,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 01:09:06,899 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-22 01:09:06,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:06,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1593832537, now seen corresponding path program 2 times [2024-11-22 01:09:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:06,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335027110] [2024-11-22 01:09:06,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:09:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:06,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:09:06,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:07,136 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-22 01:09:07,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335027110] [2024-11-22 01:09:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335027110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959534610] [2024-11-22 01:09:07,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:09:07,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:07,139 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-22 01:09:07,141 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-22 01:09:07,192 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:09:07,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:07,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 01:09:07,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:07,429 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-22 01:09:07,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:07,692 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-22 01:09:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959534610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:07,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:07,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-11-22 01:09:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574604567] [2024-11-22 01:09:07,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:07,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-22 01:09:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-22 01:09:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=678, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 01:09:07,696 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-22 01:09:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:08,061 INFO L93 Difference]: Finished difference Result 824 states and 1116 transitions. [2024-11-22 01:09:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 01:09:08,061 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-22 01:09:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:08,064 INFO L225 Difference]: With dead ends: 824 [2024-11-22 01:09:08,064 INFO L226 Difference]: Without dead ends: 534 [2024-11-22 01:09:08,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 01:09:08,071 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.2s IncrementalHoareTripleChecker+Time [2024-11-22 01:09:08,072 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.2s Time] [2024-11-22 01:09:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-22 01:09:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2024-11-22 01:09:08,110 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-22 01:09:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 670 transitions. [2024-11-22 01:09:08,112 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 670 transitions. Word has length 43 [2024-11-22 01:09:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:08,113 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 670 transitions. [2024-11-22 01:09:08,113 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-22 01:09:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 670 transitions. [2024-11-22 01:09:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 01:09:08,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:08,115 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:08,125 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-22 01:09:08,319 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-22 01:09:08,320 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1639992537, now seen corresponding path program 3 times [2024-11-22 01:09:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595996231] [2024-11-22 01:09:08,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:09:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:08,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 01:09:08,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:08,397 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-22 01:09:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595996231] [2024-11-22 01:09:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595996231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 01:09:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364648770] [2024-11-22 01:09:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:09:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:08,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:09:08,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:09:08,400 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-22 01:09:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:08,442 INFO L93 Difference]: Finished difference Result 536 states and 671 transitions. [2024-11-22 01:09:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 01:09:08,442 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-22 01:09:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:08,444 INFO L225 Difference]: With dead ends: 536 [2024-11-22 01:09:08,444 INFO L226 Difference]: Without dead ends: 396 [2024-11-22 01:09:08,445 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-22 01:09:08,446 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-22 01:09:08,447 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-22 01:09:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-22 01:09:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-22 01:09:08,469 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-22 01:09:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 523 transitions. [2024-11-22 01:09:08,470 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 523 transitions. Word has length 73 [2024-11-22 01:09:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 523 transitions. [2024-11-22 01:09:08,471 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-22 01:09:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2024-11-22 01:09:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 01:09:08,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:08,472 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:08,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 01:09:08,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash -336186329, now seen corresponding path program 1 times [2024-11-22 01:09:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758632558] [2024-11-22 01:09:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:08,976 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-22 01:09:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:08,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758632558] [2024-11-22 01:09:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758632558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:08,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-22 01:09:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217176672] [2024-11-22 01:09:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:08,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 01:09:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 01:09:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-22 01:09:08,982 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-22 01:09:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:09,320 INFO L93 Difference]: Finished difference Result 1832 states and 2440 transitions. [2024-11-22 01:09:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 01:09:09,321 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-22 01:09:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:09,326 INFO L225 Difference]: With dead ends: 1832 [2024-11-22 01:09:09,327 INFO L226 Difference]: Without dead ends: 1578 [2024-11-22 01:09:09,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-22 01:09:09,328 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 307 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 01:09:09,328 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-22 01:09:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-22 01:09:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 400. [2024-11-22 01:09:09,363 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-22 01:09:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2024-11-22 01:09:09,365 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 73 [2024-11-22 01:09:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:09,365 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2024-11-22 01:09:09,365 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-22 01:09:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2024-11-22 01:09:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 01:09:09,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:09,366 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:09,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 01:09:09,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1438821033, now seen corresponding path program 1 times [2024-11-22 01:09:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346797466] [2024-11-22 01:09:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:10,151 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-22 01:09:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346797466] [2024-11-22 01:09:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346797466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723207994] [2024-11-22 01:09:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:10,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:10,157 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-22 01:09:10,159 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-22 01:09:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:10,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 01:09:10,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:11,235 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-22 01:09:11,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:12,587 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-22 01:09:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723207994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:12,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2024-11-22 01:09:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155982600] [2024-11-22 01:09:12,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:12,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-22 01:09:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:12,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-22 01:09:12,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1574, Invalid=3828, Unknown=0, NotChecked=0, Total=5402 [2024-11-22 01:09:12,592 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-22 01:09:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:14,528 INFO L93 Difference]: Finished difference Result 798 states and 990 transitions. [2024-11-22 01:09:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-22 01:09:14,529 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-22 01:09:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:14,531 INFO L225 Difference]: With dead ends: 798 [2024-11-22 01:09:14,531 INFO L226 Difference]: Without dead ends: 796 [2024-11-22 01:09:14,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5713 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3429, Invalid=11091, Unknown=0, NotChecked=0, Total=14520 [2024-11-22 01:09:14,537 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.3s IncrementalHoareTripleChecker+Time [2024-11-22 01:09:14,537 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.3s Time] [2024-11-22 01:09:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-22 01:09:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 765. [2024-11-22 01:09:14,593 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-22 01:09:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 946 transitions. [2024-11-22 01:09:14,595 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 946 transitions. Word has length 73 [2024-11-22 01:09:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 946 transitions. [2024-11-22 01:09:14,597 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-22 01:09:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 946 transitions. [2024-11-22 01:09:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 01:09:14,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:14,598 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:14,606 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-22 01:09:14,798 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-22 01:09:14,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1623737319, now seen corresponding path program 1 times [2024-11-22 01:09:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:14,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763224582] [2024-11-22 01:09:14,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:14,897 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-22 01:09:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763224582] [2024-11-22 01:09:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763224582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 01:09:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 01:09:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975499616] [2024-11-22 01:09:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:14,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 01:09:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 01:09:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 01:09:14,900 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-22 01:09:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:15,018 INFO L93 Difference]: Finished difference Result 1189 states and 1473 transitions. [2024-11-22 01:09:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 01:09:15,019 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-22 01:09:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:15,022 INFO L225 Difference]: With dead ends: 1189 [2024-11-22 01:09:15,022 INFO L226 Difference]: Without dead ends: 990 [2024-11-22 01:09:15,023 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-22 01:09:15,023 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-22 01:09:15,024 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-22 01:09:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-22 01:09:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 843. [2024-11-22 01:09:15,090 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-22 01:09:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1049 transitions. [2024-11-22 01:09:15,093 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1049 transitions. Word has length 73 [2024-11-22 01:09:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:15,093 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1049 transitions. [2024-11-22 01:09:15,093 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-22 01:09:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1049 transitions. [2024-11-22 01:09:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 01:09:15,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:15,095 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-22 01:09:15,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 01:09:15,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:15,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2032536794, now seen corresponding path program 1 times [2024-11-22 01:09:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812314507] [2024-11-22 01:09:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:15,214 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-22 01:09:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:15,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812314507] [2024-11-22 01:09:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812314507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475377856] [2024-11-22 01:09:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:15,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:15,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:15,217 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-22 01:09:15,219 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-22 01:09:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:15,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 01:09:15,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:15,650 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-22 01:09:15,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:15,841 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-22 01:09:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475377856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:15,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:15,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-22 01:09:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251256280] [2024-11-22 01:09:15,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:15,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 01:09:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 01:09:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2024-11-22 01:09:15,843 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-22 01:09:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:16,078 INFO L93 Difference]: Finished difference Result 2081 states and 2589 transitions. [2024-11-22 01:09:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 01:09:16,079 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-22 01:09:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:16,085 INFO L225 Difference]: With dead ends: 2081 [2024-11-22 01:09:16,085 INFO L226 Difference]: Without dead ends: 1882 [2024-11-22 01:09:16,086 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-22 01:09:16,087 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 01:09:16,087 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.1s Time] [2024-11-22 01:09:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-22 01:09:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1155. [2024-11-22 01:09:16,205 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-22 01:09:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1461 transitions. [2024-11-22 01:09:16,208 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1461 transitions. Word has length 142 [2024-11-22 01:09:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:16,209 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1461 transitions. [2024-11-22 01:09:16,209 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-22 01:09:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1461 transitions. [2024-11-22 01:09:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 01:09:16,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:16,213 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-22 01:09:16,222 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-22 01:09:16,414 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-22 01:09:16,414 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1816689998, now seen corresponding path program 1 times [2024-11-22 01:09:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143435970] [2024-11-22 01:09:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:16,896 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-22 01:09:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143435970] [2024-11-22 01:09:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143435970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032948073] [2024-11-22 01:09:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 01:09:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:16,899 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-22 01:09:16,900 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-22 01:09:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 01:09:16,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 01:09:16,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:17,671 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-22 01:09:17,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 01:09:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032948073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 01:09:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 01:09:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 44 [2024-11-22 01:09:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918539002] [2024-11-22 01:09:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 01:09:17,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 01:09:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:17,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 01:09:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2024-11-22 01:09:17,674 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-22 01:09:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:17,937 INFO L93 Difference]: Finished difference Result 2101 states and 2653 transitions. [2024-11-22 01:09:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 01:09:17,938 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-22 01:09:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:17,941 INFO L225 Difference]: With dead ends: 2101 [2024-11-22 01:09:17,941 INFO L226 Difference]: Without dead ends: 876 [2024-11-22 01:09:17,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=720, Invalid=1260, Unknown=0, NotChecked=0, Total=1980 [2024-11-22 01:09:17,943 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.2s IncrementalHoareTripleChecker+Time [2024-11-22 01:09:17,944 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.2s Time] [2024-11-22 01:09:17,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-22 01:09:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 810. [2024-11-22 01:09:17,998 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-22 01:09:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 901 transitions. [2024-11-22 01:09:18,002 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 901 transitions. Word has length 145 [2024-11-22 01:09:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:18,002 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 901 transitions. [2024-11-22 01:09:18,003 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-22 01:09:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 901 transitions. [2024-11-22 01:09:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-11-22 01:09:18,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:18,010 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-22 01:09:18,019 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-22 01:09:18,211 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-22 01:09:18,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:18,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash 449680486, now seen corresponding path program 2 times [2024-11-22 01:09:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:18,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21586734] [2024-11-22 01:09:18,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:09:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:18,266 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:09:18,266 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:18,610 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-22 01:09:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21586734] [2024-11-22 01:09:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21586734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847237648] [2024-11-22 01:09:18,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 01:09:18,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:18,614 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-22 01:09:18,616 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-22 01:09:18,748 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 01:09:18,749 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:18,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 01:09:18,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:19,790 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-22 01:09:19,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:20,256 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-22 01:09:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847237648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:20,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-22 01:09:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109307519] [2024-11-22 01:09:20,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:20,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 01:09:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 01:09:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2024-11-22 01:09:20,259 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-22 01:09:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:20,588 INFO L93 Difference]: Finished difference Result 2567 states and 3037 transitions. [2024-11-22 01:09:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 01:09:20,589 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-22 01:09:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:20,593 INFO L225 Difference]: With dead ends: 2567 [2024-11-22 01:09:20,593 INFO L226 Difference]: Without dead ends: 1362 [2024-11-22 01:09:20,595 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-22 01:09:20,596 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-22 01:09:20,596 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-22 01:09:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-22 01:09:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2024-11-22 01:09:20,696 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-22 01:09:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1461 transitions. [2024-11-22 01:09:20,699 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1461 transitions. Word has length 418 [2024-11-22 01:09:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:20,700 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1461 transitions. [2024-11-22 01:09:20,700 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-22 01:09:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1461 transitions. [2024-11-22 01:09:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2024-11-22 01:09:20,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:20,727 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-22 01:09:20,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 01:09:20,931 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-22 01:09:20,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:20,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 133527270, now seen corresponding path program 3 times [2024-11-22 01:09:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:20,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949644845] [2024-11-22 01:09:20,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:09:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:21,381 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2024-11-22 01:09:21,381 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:22,679 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-22 01:09:22,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 01:09:22,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949644845] [2024-11-22 01:09:22,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949644845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 01:09:22,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882285009] [2024-11-22 01:09:22,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 01:09:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 01:09:22,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 01:09:22,683 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-22 01:09:22,685 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-22 01:09:23,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2024-11-22 01:09:23,485 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 01:09:23,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 01:09:23,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 01:09:25,517 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-22 01:09:25,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 01:09:26,598 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-22 01:09:26,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882285009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 01:09:26,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 01:09:26,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-11-22 01:09:26,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208992625] [2024-11-22 01:09:26,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 01:09:26,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-22 01:09:26,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 01:09:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-22 01:09:26,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2024-11-22 01:09:26,603 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-22 01:09:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 01:09:26,984 INFO L93 Difference]: Finished difference Result 2729 states and 3123 transitions. [2024-11-22 01:09:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 01:09:26,985 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-22 01:09:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 01:09:26,992 INFO L225 Difference]: With dead ends: 2729 [2024-11-22 01:09:26,993 INFO L226 Difference]: Without dead ends: 1776 [2024-11-22 01:09:26,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 01:09:26,995 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-22 01:09:26,995 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-22 01:09:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-22 01:09:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-22 01:09:27,083 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-22 01:09:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1881 transitions. [2024-11-22 01:09:27,086 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1881 transitions. Word has length 970 [2024-11-22 01:09:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 01:09:27,087 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 1881 transitions. [2024-11-22 01:09:27,088 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-22 01:09:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1881 transitions. [2024-11-22 01:09:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2024-11-22 01:09:27,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 01:09:27,108 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-22 01:09:27,116 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-22 01:09:27,308 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-22 01:09:27,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 01:09:27,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 01:09:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash 341765318, now seen corresponding path program 4 times [2024-11-22 01:09:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 01:09:27,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745688073] [2024-11-22 01:09:27,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 01:09:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 01:09:28,188 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 01:09:28,188 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 01:09:28,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 01:09:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 01:09:28,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 01:09:28,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 01:09:28,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 01:09:28,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 01:09:28,798 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 01:09:29,062 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 01:09:29,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:09:29 BoogieIcfgContainer [2024-11-22 01:09:29,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 01:09:29,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 01:09:29,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 01:09:29,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 01:09:29,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:03" (3/4) ... [2024-11-22 01:09:29,069 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 01:09:29,357 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 01:09:29,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 01:09:29,358 INFO L158 Benchmark]: Toolchain (without parser) took 26574.83ms. Allocated memory was 148.9MB in the beginning and 528.5MB in the end (delta: 379.6MB). Free memory was 92.1MB in the beginning and 299.4MB in the end (delta: -207.3MB). Peak memory consumption was 174.1MB. Max. memory is 16.1GB. [2024-11-22 01:09:29,358 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:09:29,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.33ms. Allocated memory is still 148.9MB. Free memory was 92.1MB in the beginning and 79.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 01:09:29,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.75ms. Allocated memory is still 148.9MB. Free memory was 79.2MB in the beginning and 77.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 01:09:29,359 INFO L158 Benchmark]: Boogie Preprocessor took 37.38ms. Allocated memory is still 148.9MB. Free memory was 77.8MB in the beginning and 76.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 01:09:29,359 INFO L158 Benchmark]: RCFGBuilder took 295.99ms. Allocated memory is still 148.9MB. Free memory was 76.1MB in the beginning and 64.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 01:09:29,359 INFO L158 Benchmark]: TraceAbstraction took 25648.05ms. Allocated memory was 148.9MB in the beginning and 528.5MB in the end (delta: 379.6MB). Free memory was 63.8MB in the beginning and 360.0MB in the end (delta: -296.2MB). Peak memory consumption was 275.8MB. Max. memory is 16.1GB. [2024-11-22 01:09:29,359 INFO L158 Benchmark]: Witness Printer took 289.53ms. Allocated memory is still 528.5MB. Free memory was 360.0MB in the beginning and 299.4MB in the end (delta: 60.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-22 01:09:29,363 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.20ms. Allocated memory is still 148.9MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.33ms. Allocated memory is still 148.9MB. Free memory was 92.1MB in the beginning and 79.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.75ms. Allocated memory is still 148.9MB. Free memory was 79.2MB in the beginning and 77.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.38ms. Allocated memory is still 148.9MB. Free memory was 77.8MB in the beginning and 76.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.99ms. Allocated memory is still 148.9MB. Free memory was 76.1MB in the beginning and 64.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25648.05ms. Allocated memory was 148.9MB in the beginning and 528.5MB in the end (delta: 379.6MB). Free memory was 63.8MB in the beginning and 360.0MB in the end (delta: -296.2MB). Peak memory consumption was 275.8MB. Max. memory is 16.1GB. * Witness Printer took 289.53ms. Allocated memory is still 528.5MB. Free memory was 360.0MB in the beginning and 299.4MB in the end (delta: 60.6MB). Peak memory consumption was 60.8MB. 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: 25.3s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2195 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2195 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 1.3s 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, 6.1s 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.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 2172 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 13.8s 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-22 01:09:29,417 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