/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 02:10:12,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 02:10:12,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 02:10:12,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 02:10:12,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 02:10:12,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 02:10:12,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 02:10:12,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 02:10:12,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 02:10:12,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 02:10:12,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 02:10:12,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 02:10:12,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 02:10:12,611 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 02:10:12,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 02:10:12,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 02:10:12,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 02:10:12,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 02:10:12,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 02:10:12,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 02:10:12,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 02:10:12,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 02:10:12,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 02:10:12,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 02:10:12,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 02:10:12,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 02:10:12,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 02:10:12,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 02:10:12,614 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 02:10:12,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 02:10:12,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 02:10:12,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 02:10:12,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 02:10:12,615 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 02:10:12,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 02:10:12,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 02:10:12,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 02:10:12,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 02:10:12,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 02:10:12,616 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 02:10:12,616 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 02:10:12,616 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 02:10:12,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 02:10:12,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 02:10:12,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 02:10:12,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 02:10:12,816 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 02:10:12,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-26 02:10:13,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 02:10:13,937 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 02:10:13,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-26 02:10:13,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b240de270/ffc2b81ec34b42eb89706453ad8b0c58/FLAGec009ee6a [2024-01-26 02:10:13,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b240de270/ffc2b81ec34b42eb89706453ad8b0c58 [2024-01-26 02:10:13,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 02:10:13,958 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 02:10:13,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 02:10:13,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 02:10:13,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 02:10:13,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:10:13" (1/1) ... [2024-01-26 02:10:13,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57009372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:13, skipping insertion in model container [2024-01-26 02:10:13,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:10:13" (1/1) ... [2024-01-26 02:10:13,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 02:10:14,149 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] [2024-01-26 02:10:14,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 02:10:14,180 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 02:10:14,212 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] [2024-01-26 02:10:14,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 02:10:14,241 INFO L206 MainTranslator]: Completed translation [2024-01-26 02:10:14,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14 WrapperNode [2024-01-26 02:10:14,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 02:10:14,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 02:10:14,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 02:10:14,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 02:10:14,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,308 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 210 [2024-01-26 02:10:14,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 02:10:14,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 02:10:14,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 02:10:14,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 02:10:14,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 02:10:14,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 02:10:14,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 02:10:14,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 02:10:14,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (1/1) ... [2024-01-26 02:10:14,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 02:10:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:10:14,381 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-01-26 02:10:14,386 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-01-26 02:10:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 02:10:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 02:10:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 02:10:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 02:10:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 02:10:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 02:10:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 02:10:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 02:10:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 02:10:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 02:10:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 02:10:14,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 02:10:14,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 02:10:14,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 02:10:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 02:10:14,406 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 02:10:14,509 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 02:10:14,510 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 02:10:14,785 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 02:10:14,844 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 02:10:14,844 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 02:10:14,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:10:14 BoogieIcfgContainer [2024-01-26 02:10:14,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 02:10:14,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 02:10:14,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 02:10:14,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 02:10:14,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 02:10:13" (1/3) ... [2024-01-26 02:10:14,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4820b7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:10:14, skipping insertion in model container [2024-01-26 02:10:14,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:10:14" (2/3) ... [2024-01-26 02:10:14,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4820b7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:10:14, skipping insertion in model container [2024-01-26 02:10:14,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:10:14" (3/3) ... [2024-01-26 02:10:14,849 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-01-26 02:10:14,855 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 02:10:14,861 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 02:10:14,861 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 02:10:14,861 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 02:10:14,907 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 02:10:14,935 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:10:14,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 02:10:14,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:10:14,954 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-01-26 02:10:14,968 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-01-26 02:10:14,983 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 02:10:14,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 02:10:14,993 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d3cc188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:10:14,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 02:10:15,092 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:10:15,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:10:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2048781337, now seen corresponding path program 1 times [2024-01-26 02:10:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:10:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323150182] [2024-01-26 02:10:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:10:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:10:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:10:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-26 02:10:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:10:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323150182] [2024-01-26 02:10:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323150182] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:10:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:10:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 02:10:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071471492] [2024-01-26 02:10:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:10:15,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 02:10:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:10:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 02:10:15,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 02:10:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:10:15,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 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-01-26 02:10:15,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:10:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 02:10:15,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:10:15,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:10:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -911671617, now seen corresponding path program 1 times [2024-01-26 02:10:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:10:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980603312] [2024-01-26 02:10:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:10:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:10:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:10:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:10:15,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:10:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980603312] [2024-01-26 02:10:15,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980603312] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:10:15,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:10:15,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 02:10:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045158955] [2024-01-26 02:10:15,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:10:15,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 02:10:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:10:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 02:10:15,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 02:10:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:10:15,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-01-26 02:10:15,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:10:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:15,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 02:10:15,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:10:15,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:10:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 206932217, now seen corresponding path program 2 times [2024-01-26 02:10:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:10:15,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355749799] [2024-01-26 02:10:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:10:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:10:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:10:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-26 02:10:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:10:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355749799] [2024-01-26 02:10:15,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355749799] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:10:15,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:10:15,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 02:10:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098531068] [2024-01-26 02:10:15,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:10:15,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 02:10:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:10:15,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 02:10:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 02:10:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,924 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:10:15,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-01-26 02:10:15,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:15,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:10:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:15,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 02:10:15,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:10:15,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:10:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1106578425, now seen corresponding path program 1 times [2024-01-26 02:10:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:10:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143728951] [2024-01-26 02:10:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:10:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:10:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:10:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:10:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:10:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143728951] [2024-01-26 02:10:16,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143728951] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:10:16,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:10:16,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 02:10:16,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427348014] [2024-01-26 02:10:16,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:10:16,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 02:10:16,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:10:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 02:10:16,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-26 02:10:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:16,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:10:16,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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-01-26 02:10:16,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:16,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:16,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:16,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:10:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:10:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 02:10:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 02:10:17,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 02:10:17,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 02:10:17,990 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-01-26 02:10:17,991 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-01-26 02:10:17,995 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:10:17,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 02:10:17,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:10:18,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 02:10:18,045 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 02:10:18,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-01-26 02:10:18,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-26 02:10:18,046 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d3cc188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:10:18,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:10:18,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-26 02:10:18,084 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-01-26 02:10:18,084 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-01-26 02:10:18,087 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:10:18,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 02:10:18,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:10:18,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 02:10:18,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-01-26 02:10:18,103 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 02:10:18,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-26 02:10:18,103 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d3cc188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:10:18,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:10:18,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-26 02:10:18,553 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-01-26 02:10:18,553 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-01-26 02:10:18,554 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 02:10:18,554 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 02:10:18,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 02:10:18 BasicIcfg [2024-01-26 02:10:18,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 02:10:18,557 INFO L158 Benchmark]: Toolchain (without parser) took 4598.54ms. Allocated memory is still 331.4MB. Free memory was 285.0MB in the beginning and 233.1MB in the end (delta: 51.9MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2024-01-26 02:10:18,557 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 249.6MB. Free memory was 197.5MB in the beginning and 197.3MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 02:10:18,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.98ms. Allocated memory is still 331.4MB. Free memory was 284.5MB in the beginning and 272.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 02:10:18,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.54ms. Allocated memory is still 331.4MB. Free memory was 272.3MB in the beginning and 270.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 02:10:18,557 INFO L158 Benchmark]: Boogie Preprocessor took 29.53ms. Allocated memory is still 331.4MB. Free memory was 270.3MB in the beginning and 268.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 02:10:18,557 INFO L158 Benchmark]: RCFGBuilder took 505.83ms. Allocated memory is still 331.4MB. Free memory was 268.2MB in the beginning and 237.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-01-26 02:10:18,558 INFO L158 Benchmark]: TraceAbstraction took 3710.64ms. Allocated memory is still 331.4MB. Free memory was 237.3MB in the beginning and 233.1MB in the end (delta: 4.2MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2024-01-26 02:10:18,558 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 249.6MB. Free memory was 197.5MB in the beginning and 197.3MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.98ms. Allocated memory is still 331.4MB. Free memory was 284.5MB in the beginning and 272.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.54ms. Allocated memory is still 331.4MB. Free memory was 272.3MB in the beginning and 270.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.53ms. Allocated memory is still 331.4MB. Free memory was 270.3MB in the beginning and 268.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 505.83ms. Allocated memory is still 331.4MB. Free memory was 268.2MB in the beginning and 237.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3710.64ms. Allocated memory is still 331.4MB. Free memory was 237.3MB in the beginning and 233.1MB in the end (delta: 4.2MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2124, independent: 1898, independent conditional: 1898, independent unconditional: 0, dependent: 226, dependent conditional: 226, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1904, independent: 1898, independent conditional: 1898, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1904, independent: 1898, independent conditional: 1898, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1919, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 21, dependent conditional: 15, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1919, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1919, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1904, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1904, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1919, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1904, unknown conditional: 0, unknown unconditional: 1904] , Statistics on independence cache: Total cache size (in pairs): 1904, Positive cache size: 1898, Positive conditional cache size: 0, Positive unconditional cache size: 1898, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 4, Independence queries for same thread: 220 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 2, RedundantProofs: 1, ProvenStates: 335, Times there's more than one choice: 194, Avg number of choices: 2.683582089552239 - StatisticsResult: Reduction benchmarks 0.1s Time before loop, 1.6s Time in loop, 1.7s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, ULTIMATE.start_main_#t~ret16#1.offset, thread1_#res#1.base, thread2_#res#1.base, ~q2_back~0, old(~q2_back~0), thread2Thread1of1ForFork1_~_argptr#1.base, thread1_#t~mem1#1, thread1_#t~mem3#1, ULTIMATE.start_main_#t~mem22#1, thread2_#t~mem6#1, ULTIMATE.start_main_#t~mem23#1, thread2_#t~mem8#1, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_main_#res#1, thread2Thread1of1ForFork1_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, old(~q1~0.offset), ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#t~mem3#1, read~int_#ptr.base, ULTIMATE.start_#t~ret27#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread1_#res#1.offset, thread2_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~_argptr#1.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~n1~0, old(~n1~0), ~n2~0, old(~n2~0), ~q1~0.base, old(~q1~0.base), thread1_#t~post2#1, thread1_#t~post4#1, thread1_#t~post5#1, thread2_#t~post7#1, thread2_#t~post9#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~pre20#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ~q2_front~0, old(~q2_front~0), ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, old(~q1_back~0), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_front~0, old(~q1_front~0), thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, ~N~0, old(~N~0), #Ultimate.allocOnHeap_#res.base, ~i~0, old(~i~0), ~j~0, old(~j~0), thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), thread2Thread1of1ForFork1_#t~post10#1, thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet21#1, thread2_#t~post10#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, old(~q2~0.offset), #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, old(#StackHeapBarrier), ULTIMATE.start_create_fresh_int_array_#t~post25#1, thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), #Ultimate.allocOnStack_#res.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, thread2Thread1of1ForFork1_#res#1.base, ~q2~0.base, old(~q2~0.base), thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~mem8#1, read~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset], Protected Variables before encountering a loop: [] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 15 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.0s Time in loop, 0.0s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, ULTIMATE.start_main_#t~ret16#1.offset, thread1_#res#1.base, thread2_#res#1.base, ~q2_back~0, old(~q2_back~0), thread2Thread1of1ForFork1_~_argptr#1.base, thread1_#t~mem1#1, thread1_#t~mem3#1, ULTIMATE.start_main_#t~mem22#1, thread2_#t~mem6#1, ULTIMATE.start_main_#t~mem23#1, thread2_#t~mem8#1, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_main_#res#1, thread2Thread1of1ForFork1_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, old(~q1~0.offset), ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#t~mem3#1, read~int_#ptr.base, ULTIMATE.start_#t~ret27#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread1_#res#1.offset, thread2_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~_argptr#1.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~n1~0, old(~n1~0), ~n2~0, old(~n2~0), ~q1~0.base, old(~q1~0.base), thread1_#t~post2#1, thread1_#t~post4#1, thread1_#t~post5#1, thread2_#t~post7#1, thread2_#t~post9#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~pre20#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ~q2_front~0, old(~q2_front~0), ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, old(~q1_back~0), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_front~0, old(~q1_front~0), thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, ~N~0, old(~N~0), #Ultimate.allocOnHeap_#res.base, ~i~0, old(~i~0), ~j~0, old(~j~0), thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), thread2Thread1of1ForFork1_#t~post10#1, thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet21#1, thread2_#t~post10#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, old(~q2~0.offset), #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, old(#StackHeapBarrier), ULTIMATE.start_create_fresh_int_array_#t~post25#1, thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), #Ultimate.allocOnStack_#res.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, thread2Thread1of1ForFork1_#res#1.base, ~q2~0.base, old(~q2~0.base), thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~mem8#1, read~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset], Protected Variables before encountering a loop: [] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 441, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 97, dependent conditional: 97, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 360, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 360, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 360, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 360, unknown conditional: 0, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 344, Positive conditional cache size: 0, Positive unconditional cache size: 344, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 81 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.4s Time in loop, 0.4s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, ULTIMATE.start_main_#t~ret16#1.offset, thread1_#res#1.base, thread2_#res#1.base, ~q2_back~0, old(~q2_back~0), thread2Thread1of1ForFork1_~_argptr#1.base, thread1_#t~mem1#1, thread1_#t~mem3#1, ULTIMATE.start_main_#t~mem22#1, thread2_#t~mem6#1, ULTIMATE.start_main_#t~mem23#1, thread2_#t~mem8#1, ULTIMATE.start_main_#t~ret17#1.offset, ULTIMATE.start_main_#res#1, thread2Thread1of1ForFork1_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~q1~0.offset, old(~q1~0.offset), ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#t~mem3#1, read~int_#ptr.base, ULTIMATE.start_#t~ret27#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread1_#res#1.offset, thread2_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet26#1, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~_argptr#1.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~n1~0, old(~n1~0), ~n2~0, old(~n2~0), ~q1~0.base, old(~q1~0.base), thread1_#t~post2#1, thread1_#t~post4#1, thread1_#t~post5#1, thread2_#t~post7#1, thread2_#t~post9#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~pre20#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ~q2_front~0, old(~q2_front~0), ULTIMATE.start_main_#t~ret16#1.base, ~q1_back~0, old(~q1_back~0), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_front~0, old(~q1_front~0), thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, ~N~0, old(~N~0), #Ultimate.allocOnHeap_#res.base, ~i~0, old(~i~0), ~j~0, old(~j~0), thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), thread2Thread1of1ForFork1_#t~post10#1, thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet21#1, thread2_#t~post10#1, ULTIMATE.start_main_~#t1~0#1.base, ~q2~0.offset, old(~q2~0.offset), #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base, #StackHeapBarrier, old(#StackHeapBarrier), ULTIMATE.start_create_fresh_int_array_#t~post25#1, thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), #Ultimate.allocOnStack_#res.base, ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.offset, thread2Thread1of1ForFork1_#res#1.base, ~q2~0.base, old(~q2~0.base), thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~mem8#1, read~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset], Protected Variables before encountering a loop: [] - PositiveResult [Line: 102]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 195 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 599 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 1181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 195 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 195 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-26 02:10:18,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-01-26 02:10:18,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-01-26 02:10:18,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-01-26 02:10:19,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...