/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 06:35:44,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 06:35:44,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-07 06:35:44,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 06:35:44,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 06:35:44,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 06:35:44,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 06:35:44,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 06:35:44,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 06:35:44,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 06:35:44,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 06:35:44,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 06:35:44,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 06:35:44,335 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 06:35:44,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 06:35:44,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 06:35:44,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 06:35:44,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 06:35:44,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 06:35:44,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 06:35:44,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 06:35:44,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 06:35:44,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 06:35:44,337 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 06:35:44,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 06:35:44,337 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 06:35:44,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 06:35:44,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 06:35:44,338 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 06:35:44,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 06:35:44,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 06:35:44,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 06:35:44,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 06:35:44,339 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 06:35:44,340 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-07 06:35:44,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-09-07 06:35:44,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 06:35:44,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 06:35:44,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 06:35:44,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 06:35:44,536 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 06:35:44,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-09-07 06:35:45,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 06:35:45,655 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 06:35:45,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-09-07 06:35:45,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf262d94/712343a24bdb44e0b250595a85a7b451/FLAG2c84b4456 [2023-09-07 06:35:45,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf262d94/712343a24bdb44e0b250595a85a7b451 [2023-09-07 06:35:45,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 06:35:45,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 06:35:45,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 06:35:45,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 06:35:45,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 06:35:45,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3f9fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45, skipping insertion in model container [2023-09-07 06:35:45,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,705 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 06:35:45,804 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-09-07 06:35:45,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 06:35:45,817 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 06:35:45,829 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-09-07 06:35:45,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 06:35:45,837 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 06:35:45,837 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 06:35:45,841 INFO L206 MainTranslator]: Completed translation [2023-09-07 06:35:45,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45 WrapperNode [2023-09-07 06:35:45,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 06:35:45,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 06:35:45,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 06:35:45,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 06:35:45,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,875 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 149 [2023-09-07 06:35:45,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 06:35:45,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 06:35:45,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 06:35:45,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 06:35:45,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 06:35:45,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 06:35:45,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 06:35:45,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 06:35:45,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (1/1) ... [2023-09-07 06:35:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 06:35:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:45,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-07 06:35:45,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-07 06:35:45,993 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-07 06:35:45,993 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-07 06:35:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 06:35:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-07 06:35:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-07 06:35:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-07 06:35:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 06:35:45,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 06:35:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 06:35:45,995 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 06:35:46,059 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 06:35:46,060 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 06:35:46,200 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 06:35:46,273 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 06:35:46,273 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-07 06:35:46,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:35:46 BoogieIcfgContainer [2023-09-07 06:35:46,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 06:35:46,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 06:35:46,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 06:35:46,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 06:35:46,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:35:45" (1/3) ... [2023-09-07 06:35:46,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2256ea85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:35:46, skipping insertion in model container [2023-09-07 06:35:46,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:35:45" (2/3) ... [2023-09-07 06:35:46,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2256ea85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:35:46, skipping insertion in model container [2023-09-07 06:35:46,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:35:46" (3/3) ... [2023-09-07 06:35:46,283 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-09-07 06:35:46,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 06:35:46,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 06:35:46,308 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-07 06:35:46,308 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 06:35:46,340 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-07 06:35:46,365 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 06:35:46,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 06:35:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:46,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 06:35:46,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-07 06:35:46,419 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-07 06:35:46,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 06:35:46,428 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6e3ac60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 06:35:46,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2023-09-07 06:35:46,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:46,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 577370306, now seen corresponding path program 1 times [2023-09-07 06:35:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:46,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720302435] [2023-09-07 06:35:46,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-07 06:35:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 06:35:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720302435] [2023-09-07 06:35:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720302435] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 06:35:46,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 06:35:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 06:35:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98697469] [2023-09-07 06:35:46,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 06:35:46,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 06:35:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 06:35:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 06:35:46,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 06:35:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:46,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 06:35:46,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 06:35:46,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 06:35:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:46,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 06:35:46,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:46,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1827397380, now seen corresponding path program 1 times [2023-09-07 06:35:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46020091] [2023-09-07 06:35:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 06:35:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 06:35:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46020091] [2023-09-07 06:35:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46020091] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 06:35:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956330750] [2023-09-07 06:35:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:47,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 06:35:47,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-07 06:35:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:47,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-07 06:35:47,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 06:35:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 06:35:47,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 06:35:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 06:35:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956330750] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 06:35:47,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 06:35:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-09-07 06:35:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124541765] [2023-09-07 06:35:47,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 06:35:47,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-09-07 06:35:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 06:35:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-09-07 06:35:47,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-09-07 06:35:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:47,857 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 06:35:47,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.541666666666667) internal successors, (157), 24 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 06:35:47,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:47,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 06:35:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:48,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-07 06:35:48,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-09-07 06:35:48,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:48,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1342707248, now seen corresponding path program 2 times [2023-09-07 06:35:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:48,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449259286] [2023-09-07 06:35:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-09-07 06:35:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 06:35:48,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449259286] [2023-09-07 06:35:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449259286] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 06:35:48,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614585328] [2023-09-07 06:35:48,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 06:35:48,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:48,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:48,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 06:35:48,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-07 06:35:48,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 06:35:48,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 06:35:48,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-07 06:35:48,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 06:35:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-09-07 06:35:48,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 06:35:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-09-07 06:35:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614585328] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 06:35:48,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 06:35:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-09-07 06:35:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776118709] [2023-09-07 06:35:48,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 06:35:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-09-07 06:35:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 06:35:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-09-07 06:35:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-09-07 06:35:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:48,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 06:35:48,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.73913043478261) internal successors, (201), 23 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 06:35:48,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:48,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:48,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 06:35:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:49,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-09-07 06:35:49,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:49,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:49,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2093845436, now seen corresponding path program 3 times [2023-09-07 06:35:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:49,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226935233] [2023-09-07 06:35:49,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-07 06:35:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 06:35:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226935233] [2023-09-07 06:35:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226935233] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 06:35:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438480057] [2023-09-07 06:35:49,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-07 06:35:49,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:49,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 06:35:49,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-07 06:35:50,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-07 06:35:50,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 06:35:50,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-07 06:35:50,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 06:35:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-07 06:35:50,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 06:35:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-07 06:35:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438480057] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 06:35:50,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 06:35:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2023-09-07 06:35:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737085369] [2023-09-07 06:35:50,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 06:35:50,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-07 06:35:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 06:35:50,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-07 06:35:50,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2023-09-07 06:35:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:50,645 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 06:35:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.5) internal successors, (221), 34 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 06:35:50,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:50,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:50,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:50,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 06:35:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-07 06:35:51,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-07 06:35:51,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:51,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:51,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash 319197180, now seen corresponding path program 4 times [2023-09-07 06:35:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991622142] [2023-09-07 06:35:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 61 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-09-07 06:35:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 06:35:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991622142] [2023-09-07 06:35:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991622142] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 06:35:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534462197] [2023-09-07 06:35:51,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-07 06:35:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:51,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:51,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 06:35:51,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-07 06:35:51,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-07 06:35:51,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 06:35:51,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-07 06:35:51,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 06:35:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-09-07 06:35:52,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 06:35:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-09-07 06:35:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534462197] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 06:35:52,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 06:35:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2023-09-07 06:35:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307329150] [2023-09-07 06:35:52,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 06:35:52,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-09-07 06:35:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 06:35:52,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-09-07 06:35:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-09-07 06:35:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:52,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 06:35:52,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.2727272727272725) internal successors, (232), 44 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 06:35:52,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:52,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:52,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:52,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-09-07 06:35:52,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 06:35:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-07 06:35:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-07 06:35:53,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-07 06:35:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:53,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:53,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash 617756104, now seen corresponding path program 5 times [2023-09-07 06:35:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942422168] [2023-09-07 06:35:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 06:35:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 77 proven. 76 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-09-07 06:35:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 06:35:53,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942422168] [2023-09-07 06:35:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942422168] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 06:35:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461081996] [2023-09-07 06:35:53,816 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-07 06:35:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 06:35:53,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 06:35:53,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-07 06:35:53,939 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-09-07 06:35:53,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 06:35:53,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 20 conjunts are in the unsatisfiable core [2023-09-07 06:35:53,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 06:35:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-09-07 06:35:54,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 06:35:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 44 proven. 73 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-09-07 06:35:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461081996] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 06:35:54,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 06:35:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2023-09-07 06:35:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660429867] [2023-09-07 06:35:54,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 06:35:54,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-09-07 06:35:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 06:35:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-09-07 06:35:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2125, Unknown=0, NotChecked=0, Total=2352 [2023-09-07 06:35:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:54,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 06:35:54,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.979591836734694) internal successors, (293), 49 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 06:35:54,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:54,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:54,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:54,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-09-07 06:35:54,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-07 06:35:54,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 06:35:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 06:35:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-07 06:35:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-07 06:35:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-07 06:35:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-07 06:35:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-09-07 06:35:57,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-07 06:35:57,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 06:35:57,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 06:35:57,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 06:35:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2025193476, now seen corresponding path program 6 times [2023-09-07 06:35:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 06:35:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238438108] [2023-09-07 06:35:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 06:35:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 06:35:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-07 06:35:57,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-07 06:35:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-07 06:35:57,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-07 06:35:57,733 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-07 06:35:57,733 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 06:35:57,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-07 06:35:57,737 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1] [2023-09-07 06:35:57,738 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3) [2023-09-07 06:35:57,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-07 06:35:57,740 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-07 06:35:57,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:35:57 BasicIcfg [2023-09-07 06:35:57,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-07 06:35:57,812 INFO L158 Benchmark]: Toolchain (without parser) took 12131.50ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 201.2MB in the beginning and 269.6MB in the end (delta: -68.4MB). Peak memory consumption was 205.8MB. Max. memory is 7.0GB. [2023-09-07 06:35:57,812 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory was 159.6MB in the beginning and 159.5MB in the end (delta: 82.2kB). There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 06:35:57,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.95ms. Allocated memory is still 249.6MB. Free memory was 200.9MB in the beginning and 189.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-07 06:35:57,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.91ms. Allocated memory is still 249.6MB. Free memory was 189.3MB in the beginning and 187.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 06:35:57,813 INFO L158 Benchmark]: Boogie Preprocessor took 25.09ms. Allocated memory is still 249.6MB. Free memory was 187.3MB in the beginning and 185.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-07 06:35:57,813 INFO L158 Benchmark]: RCFGBuilder took 374.13ms. Allocated memory is still 249.6MB. Free memory was 185.6MB in the beginning and 159.7MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 7.0GB. [2023-09-07 06:35:57,813 INFO L158 Benchmark]: TraceAbstraction took 11535.39ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 158.9MB in the beginning and 269.6MB in the end (delta: -110.6MB). Peak memory consumption was 162.8MB. Max. memory is 7.0GB. [2023-09-07 06:35:57,814 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory was 159.6MB in the beginning and 159.5MB in the end (delta: 82.2kB). There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 158.95ms. Allocated memory is still 249.6MB. Free memory was 200.9MB in the beginning and 189.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 32.91ms. Allocated memory is still 249.6MB. Free memory was 189.3MB in the beginning and 187.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 25.09ms. Allocated memory is still 249.6MB. Free memory was 187.3MB in the beginning and 185.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * RCFGBuilder took 374.13ms. Allocated memory is still 249.6MB. Free memory was 185.6MB in the beginning and 159.7MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 7.0GB. * TraceAbstraction took 11535.39ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 158.9MB in the beginning and 269.6MB in the end (delta: -110.6MB). Peak memory consumption was 162.8MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 393, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 337, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 49, dependent conditional: 36, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 373, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 373, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 337, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 337, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 373, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 337, unknown conditional: 0, unknown unconditional: 337] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 324, Positive conditional cache size: 0, Positive unconditional cache size: 324, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 6, Independence queries for same thread: 56 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 12, RedundantProofs: 4, ProvenStates: 84 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, N=0, counter=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, N=0, counter=0, t1={6:0}, t2={5:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, __VERIFIER_nondet_int()=6, counter=0, t1={6:0}, t2={5:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=6, \old(cond)=1, cond=1, counter=0] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=6, \old(cond)=1, cond=1, counter=0] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, malloc(sizeof(int) * (size_t)size)={3:0}, size=6] [L97] 0 int i = 0; VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=0, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=0, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, __VERIFIER_nondet_int()=-2, arr={3:0}, counter=0, i=0, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=1, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=1, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, __VERIFIER_nondet_int()=0, arr={3:0}, counter=0, i=1, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=2, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=2, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, __VERIFIER_nondet_int()=-3, arr={3:0}, counter=0, i=2, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=3, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=3, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, __VERIFIER_nondet_int()=0, arr={3:0}, counter=0, i=3, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=4, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=4, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, __VERIFIER_nondet_int()=-7, arr={3:0}, counter=0, i=4, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=5, size=6] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=5, size=6] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=6, \old(size)=6, __VERIFIER_nondet_int()=0, arr={3:0}, counter=0, i=5, size=6] [L97] 0 i++ VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=6, size=6] [L97] COND FALSE 0 !(i < size) VAL [A={0:0}, N=6, \old(size)=6, arr={3:0}, counter=0, i=6, size=6] [L100] 0 return arr; VAL [A={0:0}, N=6, \old(size)=6, \result={3:0}, arr={3:0}, counter=0, size=6] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, N=6, counter=0, create_fresh_int_array(N)={3:0}, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=6, counter=0, pthread_create(&t1, 0, thread1, 0)=-14, t1={6:0}, t2={5:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=6, counter=0, pthread_create(&t2, 0, thread2, 0)=-13, t1={6:0}, t2={5:0}] [L83] 0 \read(t1) VAL [A={3:0}, N=6, \read(t1)=-14, counter=0, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, N=6, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=6, counter=-2, i=0, tmp=-2] [L49] 1 i++ VAL [A={3:0}, N=6, counter=-2, i=1, tmp=-2] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=6, counter=-2, i=1, tmp=-2] [L49] 1 i++ VAL [A={3:0}, N=6, counter=-2, i=2, tmp=-2] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=6, counter=-5, i=2, tmp=-5] [L49] 1 i++ VAL [A={3:0}, N=6, counter=-5, i=3, tmp=-5] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=6, counter=-5, i=3, tmp=-5] [L49] 1 i++ VAL [A={3:0}, N=6, counter=-5, i=4, tmp=-5] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={3:0}, N=6, counter=-5, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=6, counter=-12, i=4, tmp=-12] [L49] 1 i++ VAL [A={3:0}, N=6, counter=-12, i=5, tmp=-12] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=6, counter=-12, i=5, tmp=-12] [L49] 1 i++ VAL [A={3:0}, N=6, counter=-12, i=6, tmp=-12] [L49] COND FALSE 1 !(i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=6, counter=-3, i=1, tmp=-3] [L62] 2 i++ VAL [A={3:0}, N=6, counter=-3, i=2, tmp=-3] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=6, counter=0, i=2, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=6, counter=0, i=3, tmp=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=6, counter=0, i=3, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=6, counter=0, i=4, tmp=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=6, counter=7, i=4, tmp=7] [L62] 2 i++ VAL [A={3:0}, N=6, counter=7, i=5, tmp=7] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=6, counter=7, i=5, tmp=7] [L62] 2 i++ VAL [A={3:0}, N=6, counter=7, i=6, tmp=7] [L62] COND FALSE 2 !(i