/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 03:35:18,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 03:35:19,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 03:35:19,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 03:35:19,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 03:35:19,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 03:35:19,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 03:35:19,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 03:35:19,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 03:35:19,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 03:35:19,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 03:35:19,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 03:35:19,069 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 03:35:19,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 03:35:19,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 03:35:19,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 03:35:19,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 03:35:19,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 03:35:19,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 03:35:19,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 03:35:19,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 03:35:19,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 03:35:19,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 03:35:19,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 03:35:19,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 03:35:19,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 03:35:19,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 03:35:19,073 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 03:35:19,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 03:35:19,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 03:35:19,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 03:35:19,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 03:35:19,076 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/UGemCutter-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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-05-05 03:35:19,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 03:35:19,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 03:35:19,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 03:35:19,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 03:35:19,304 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 03:35:19,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-05 03:35:20,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 03:35:20,518 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 03:35:20,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-05 03:35:20,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6fc2c239/55aa97e18e814074a073cfd25025a74c/FLAG74695ae2b [2024-05-05 03:35:20,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6fc2c239/55aa97e18e814074a073cfd25025a74c [2024-05-05 03:35:20,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 03:35:20,536 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 03:35:20,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 03:35:20,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 03:35:20,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 03:35:20,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbf77f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20, skipping insertion in model container [2024-05-05 03:35:20,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 03:35:20,738 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] [2024-05-05 03:35:20,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 03:35:20,767 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 03:35:20,786 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] [2024-05-05 03:35:20,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 03:35:20,796 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 03:35:20,796 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 03:35:20,801 INFO L206 MainTranslator]: Completed translation [2024-05-05 03:35:20,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20 WrapperNode [2024-05-05 03:35:20,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 03:35:20,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 03:35:20,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 03:35:20,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 03:35:20,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,835 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 148 [2024-05-05 03:35:20,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 03:35:20,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 03:35:20,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 03:35:20,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 03:35:20,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 03:35:20,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 03:35:20,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 03:35:20,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 03:35:20,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (1/1) ... [2024-05-05 03:35:20,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 03:35:20,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:20,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-05 03:35:20,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-05 03:35:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 03:35:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 03:35:20,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-05 03:35:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-05 03:35:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 03:35:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 03:35:20,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 03:35:20,935 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 03:35:21,040 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 03:35:21,042 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 03:35:21,272 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 03:35:21,357 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 03:35:21,357 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-05 03:35:21,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 03:35:21 BoogieIcfgContainer [2024-05-05 03:35:21,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 03:35:21,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 03:35:21,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 03:35:21,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 03:35:21,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 03:35:20" (1/3) ... [2024-05-05 03:35:21,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab5d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 03:35:21, skipping insertion in model container [2024-05-05 03:35:21,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:35:20" (2/3) ... [2024-05-05 03:35:21,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab5d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 03:35:21, skipping insertion in model container [2024-05-05 03:35:21,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 03:35:21" (3/3) ... [2024-05-05 03:35:21,363 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-05-05 03:35:21,370 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 03:35:21,376 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 03:35:21,376 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 03:35:21,376 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 03:35:21,440 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-05 03:35:21,479 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 03:35:21,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 03:35:21,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:21,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-05 03:35:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-05 03:35:21,508 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 03:35:21,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:21,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 03:35:21,522 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=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;@1039a0bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-05 03:35:21,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-05 03:35:21,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:21,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -390255850, now seen corresponding path program 1 times [2024-05-05 03:35:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:21,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711265861] [2024-05-05 03:35:21,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:21,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-05 03:35:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711265861] [2024-05-05 03:35:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711265861] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:35:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:35:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 03:35:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15033324] [2024-05-05 03:35:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:35:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 03:35:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 03:35:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 03:35:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:22,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 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-05-05 03:35:22,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 03:35:22,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:22,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1599570191, now seen corresponding path program 1 times [2024-05-05 03:35:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512320461] [2024-05-05 03:35:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512320461] [2024-05-05 03:35:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512320461] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 03:35:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 03:35:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 03:35:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955992752] [2024-05-05 03:35:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:35:22,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 03:35:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-05 03:35:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-05 03:35:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:22,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-05-05 03:35:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:22,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-05 03:35:22,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:22,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 175241813, now seen corresponding path program 1 times [2024-05-05 03:35:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596249948] [2024-05-05 03:35:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596249948] [2024-05-05 03:35:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596249948] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813615250] [2024-05-05 03:35:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:22,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:22,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-05 03:35:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:22,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-05 03:35:22,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:23,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813615250] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-05 03:35:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-05-05 03:35:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035909421] [2024-05-05 03:35:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 03:35:23,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 03:35:23,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-05 03:35:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-05 03:35:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:23,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:23,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-05-05 03:35:23,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:23,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:23,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:23,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-05 03:35:23,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-05 03:35:23,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:23,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2045221921, now seen corresponding path program 1 times [2024-05-05 03:35:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322595761] [2024-05-05 03:35:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:23,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322595761] [2024-05-05 03:35:23,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322595761] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:23,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836147084] [2024-05-05 03:35:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:23,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:23,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-05 03:35:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:23,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-05 03:35:23,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:24,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:24,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836147084] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:35:24,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:35:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-05-05 03:35:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498607553] [2024-05-05 03:35:24,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:35:24,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-05 03:35:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-05 03:35:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-05-05 03:35:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:24,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:24,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.708333333333333) internal successors, (185), 24 states have internal predecessors, (185), 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-05-05 03:35:24,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:24,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:24,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:24,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:24,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-05 03:35:24,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:24,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:24,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1897562747, now seen corresponding path program 2 times [2024-05-05 03:35:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638583425] [2024-05-05 03:35:24,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:24,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638583425] [2024-05-05 03:35:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638583425] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748091536] [2024-05-05 03:35:24,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 03:35:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:24,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:24,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-05 03:35:24,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 03:35:24,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:35:24,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-05 03:35:24,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-05 03:35:25,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-05 03:35:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748091536] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:35:25,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:35:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 22 [2024-05-05 03:35:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080285356] [2024-05-05 03:35:25,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:35:25,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-05 03:35:25,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-05 03:35:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-05-05 03:35:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:25,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:25,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.136363636363637) internal successors, (201), 22 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) [2024-05-05 03:35:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:25,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:25,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-05 03:35:26,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:26,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:26,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1024821117, now seen corresponding path program 3 times [2024-05-05 03:35:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86528389] [2024-05-05 03:35:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-05-05 03:35:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86528389] [2024-05-05 03:35:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86528389] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432953767] [2024-05-05 03:35:26,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 03:35:26,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:26,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:26,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:26,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-05 03:35:26,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-05 03:35:26,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:35:26,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-05 03:35:26,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-05 03:35:26,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-05 03:35:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432953767] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:35:26,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:35:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2024-05-05 03:35:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338182786] [2024-05-05 03:35:26,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:35:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-05 03:35:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-05 03:35:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2024-05-05 03:35:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:26,943 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:26,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.162162162162162) internal successors, (265), 37 states have internal predecessors, (265), 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-05-05 03:35:26,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:26,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:26,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:26,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:26,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:26,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:27,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-05 03:35:27,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-05 03:35:27,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:27,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1881657625, now seen corresponding path program 4 times [2024-05-05 03:35:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686930220] [2024-05-05 03:35:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 03:35:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686930220] [2024-05-05 03:35:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686930220] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498710346] [2024-05-05 03:35:27,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-05 03:35:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:27,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-05 03:35:27,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-05 03:35:27,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:35:27,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 03:35:27,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 80 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-05 03:35:28,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 80 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-05 03:35:28,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498710346] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:35:28,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:35:28,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 46 [2024-05-05 03:35:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744352527] [2024-05-05 03:35:28,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:35:28,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-05 03:35:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-05 03:35:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1737, Unknown=0, NotChecked=0, Total=2070 [2024-05-05 03:35:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:28,831 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:28,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.369565217391305) internal successors, (293), 46 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) [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:28,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 03:35:29,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-05 03:35:29,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:29,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:29,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1318370997, now seen corresponding path program 5 times [2024-05-05 03:35:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515845578] [2024-05-05 03:35:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 40 proven. 95 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-05 03:35:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515845578] [2024-05-05 03:35:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515845578] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498775869] [2024-05-05 03:35:29,790 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-05 03:35:29,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:29,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:29,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-05 03:35:29,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-05-05 03:35:29,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:35:29,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-05 03:35:29,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-05 03:35:30,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-05-05 03:35:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498775869] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:35:30,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:35:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 8] total 42 [2024-05-05 03:35:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369023233] [2024-05-05 03:35:30,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:35:30,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-05 03:35:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-05 03:35:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2024-05-05 03:35:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:30,487 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:30,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.809523809523809) internal successors, (286), 42 states have internal predecessors, (286), 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-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 03:35:30,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 03:35:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-05 03:35:32,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-05 03:35:32,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-05 03:35:32,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:32,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1762581039, now seen corresponding path program 6 times [2024-05-05 03:35:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237664198] [2024-05-05 03:35:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 03:35:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 211 proven. 68 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-05 03:35:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 03:35:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237664198] [2024-05-05 03:35:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237664198] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 03:35:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147259970] [2024-05-05 03:35:33,241 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-05 03:35:33,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:33,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 03:35:33,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 03:35:33,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-05 03:35:33,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-05 03:35:33,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 03:35:33,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-05 03:35:33,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 03:35:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 261 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 03:35:34,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 03:35:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 261 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-05 03:35:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147259970] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 03:35:34,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 03:35:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 27] total 70 [2024-05-05 03:35:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465107336] [2024-05-05 03:35:34,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 03:35:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-05-05 03:35:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 03:35:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-05-05 03:35:34,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=4147, Unknown=0, NotChecked=0, Total=4830 [2024-05-05 03:35:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:34,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 03:35:34,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 6.1571428571428575) internal successors, (431), 70 states have internal predecessors, (431), 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-05-05 03:35:34,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:34,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:34,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:34,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:34,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:34,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:34,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-05 03:35:34,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-05-05 03:35:34,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-05 03:35:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-05 03:35:35,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-05 03:35:35,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 03:35:35,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-05 03:35:35,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 03:35:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash 778376027, now seen corresponding path program 7 times [2024-05-05 03:35:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 03:35:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499006257] [2024-05-05 03:35:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 03:35:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 03:35:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:35:35,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 03:35:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 03:35:36,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 03:35:36,122 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 03:35:36,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-05 03:35:36,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-05 03:35:36,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-05 03:35:36,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-05 03:35:36,127 INFO L448 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-05-05 03:35:36,130 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 03:35:36,130 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 03:35:36,194 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2024-05-05 03:35:36,195 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc15 [2024-05-05 03:35:36,195 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,196 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,196 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,197 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,197 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,197 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,198 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-05 03:35:36,198 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-05 03:35:36,198 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret8 [2024-05-05 03:35:36,198 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-05 03:35:36,199 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-05 03:35:36,199 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2024-05-05 03:35:36,202 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-05 03:35:36,202 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-05 03:35:36,203 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2024-05-05 03:35:36,203 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2024-05-05 03:35:36,203 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2024-05-05 03:35:36,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 03:35:36 BasicIcfg [2024-05-05 03:35:36,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 03:35:36,217 INFO L158 Benchmark]: Toolchain (without parser) took 15681.11ms. Allocated memory was 151.0MB in the beginning and 368.1MB in the end (delta: 217.1MB). Free memory was 87.7MB in the beginning and 261.4MB in the end (delta: -173.7MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. [2024-05-05 03:35:36,217 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 151.0MB. Free memory was 129.4MB in the beginning and 129.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 03:35:36,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.37ms. Allocated memory is still 151.0MB. Free memory was 87.5MB in the beginning and 122.6MB in the end (delta: -35.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-05-05 03:35:36,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.07ms. Allocated memory is still 151.0MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 03:35:36,217 INFO L158 Benchmark]: Boogie Preprocessor took 25.11ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 118.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 03:35:36,218 INFO L158 Benchmark]: RCFGBuilder took 496.66ms. Allocated memory is still 151.0MB. Free memory was 118.9MB in the beginning and 90.0MB in the end (delta: 28.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2024-05-05 03:35:36,218 INFO L158 Benchmark]: TraceAbstraction took 14856.76ms. Allocated memory was 151.0MB in the beginning and 368.1MB in the end (delta: 217.1MB). Free memory was 88.5MB in the beginning and 261.4MB in the end (delta: -173.0MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. [2024-05-05 03:35:36,219 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.09ms. Allocated memory is still 151.0MB. Free memory was 129.4MB in the beginning and 129.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.37ms. Allocated memory is still 151.0MB. Free memory was 87.5MB in the beginning and 122.6MB in the end (delta: -35.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.07ms. Allocated memory is still 151.0MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.11ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 118.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 496.66ms. Allocated memory is still 151.0MB. Free memory was 118.9MB in the beginning and 90.0MB in the end (delta: 28.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 14856.76ms. Allocated memory was 151.0MB in the beginning and 368.1MB in the end (delta: 217.1MB). Free memory was 88.5MB in the beginning and 261.4MB in the end (delta: -173.0MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc15 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - 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: 3375, independent: 2755, independent conditional: 2755, independent unconditional: 0, dependent: 620, dependent conditional: 620, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2785, independent: 2755, independent conditional: 2755, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2785, independent: 2755, independent conditional: 2755, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2785, independent: 2755, independent conditional: 2755, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2875, independent: 2755, independent conditional: 903, independent unconditional: 1852, dependent: 120, dependent conditional: 62, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2875, independent: 2755, independent conditional: 886, independent unconditional: 1869, dependent: 120, dependent conditional: 21, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2875, independent: 2755, independent conditional: 886, independent unconditional: 1869, dependent: 120, dependent conditional: 21, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 217, independent conditional: 39, independent unconditional: 178, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 88, dependent conditional: 31, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2875, independent: 2538, independent conditional: 847, independent unconditional: 1691, dependent: 106, dependent conditional: 12, dependent unconditional: 94, unknown: 231, unknown conditional: 48, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 217, Positive conditional cache size: 39, Positive unconditional cache size: 178, Negative cache size: 14, Negative conditional cache size: 9, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2875, independent: 2755, independent conditional: 903, independent unconditional: 1852, dependent: 120, dependent conditional: 62, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2875, independent: 2755, independent conditional: 886, independent unconditional: 1869, dependent: 120, dependent conditional: 21, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2875, independent: 2755, independent conditional: 886, independent unconditional: 1869, dependent: 120, dependent conditional: 21, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 217, independent conditional: 39, independent unconditional: 178, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 88, dependent conditional: 31, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2875, independent: 2538, independent conditional: 847, independent unconditional: 1691, dependent: 106, dependent conditional: 12, dependent unconditional: 94, unknown: 231, unknown conditional: 48, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 217, Positive conditional cache size: 39, Positive unconditional cache size: 178, Negative cache size: 14, Negative conditional cache size: 9, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58 ], Independence queries for same thread: 590 - 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=7, 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=7, \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=7, \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=7, \old(size)=7, arr={3:0}, counter=0, size=7] [L97] 0 int i = 0; VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=0, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=0, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=0, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=1, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=1, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=1, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=2, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=2, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=2, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=3, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=3, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=3, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=4, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=4, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=4, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=5, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=5, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=5, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=6, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=6, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=6, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=7, size=7] [L97] COND FALSE 0 !(i < size) VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=7, size=7] [L100] 0 return arr; VAL [A={0:0}, N=7, \old(size)=7, \result={3:0}, arr={3:0}, counter=0, size=7] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, N=7, counter=0, i=0] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={3:0}, N=7, counter=0, i=0] [L83] 0 \read(t1) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5: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=7, counter=7, i=0, tmp=7] [L49] 1 i++ VAL [A={3:0}, N=7, counter=7, i=1, 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=7, counter=0, i=0, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=1, tmp=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=7, counter=2147483647, i=1, tmp=2147483647] [L49] 1 i++ VAL [A={3:0}, N=7, counter=2147483647, i=2, tmp=2147483647] [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=7, counter=0, i=1, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=2, tmp=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=7, counter=9, i=2, tmp=9] [L49] 1 i++ VAL [A={3:0}, N=7, counter=9, i=3, tmp=9] [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=7, counter=0, i=2, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=3, tmp=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=7, counter=10, i=3, tmp=10] [L49] 1 i++ VAL [A={3:0}, N=7, counter=10, i=4, tmp=10] [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=7, counter=0, i=3, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=4, tmp=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=7, counter=11, i=4, tmp=11] [L49] 1 i++ VAL [A={3:0}, N=7, counter=11, i=5, tmp=11] [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=7, counter=0, i=4, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=5, tmp=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]); [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=7, counter=13, i=5, tmp=13] [L62] 2 i++ VAL [A={3:0}, N=7, counter=13, i=6, tmp=13] [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=7, counter=-13, i=5, tmp=-13] [L49] 1 i++ VAL [A={3:0}, N=7, counter=-13, i=6, tmp=-13] [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=25, i=6, tmp=25] [L62] 2 i++ VAL [A={3:0}, N=7, counter=25, i=7, tmp=25] [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=7, counter=13, i=6, tmp=13] [L49] 1 i++ VAL [A={3:0}, N=7, counter=13, i=7, tmp=13] [L62] COND FALSE 2 !(i