/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 RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 15:41:06,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 15:41:06,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 15:41:06,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 15:41:06,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 15:41:06,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 15:41:06,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 15:41:06,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 15:41:06,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 15:41:06,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 15:41:06,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 15:41:06,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 15:41:07,000 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 15:41:07,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 15:41:07,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 15:41:07,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 15:41:07,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 15:41:07,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 15:41:07,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 15:41:07,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 15:41:07,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 15:41:07,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 15:41:07,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 15:41:07,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 15:41:07,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 15:41:07,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 15:41:07,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 15:41:07,004 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 15:41:07,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 15:41:07,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 15:41:07,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 15:41:07,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 15:41:07,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 15:41:07,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 15:41:07,007 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 15:41:07,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 15:41:07,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 15:41:07,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 15:41:07,007 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 15:41:07,008 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-05-05 15:41:07,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 15:41:07,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 15:41:07,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 15:41:07,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 15:41:07,346 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 15:41:07,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2024-05-05 15:41:08,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 15:41:08,836 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 15:41:08,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2024-05-05 15:41:08,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9d19ee182/0625bf9a4c5f41c3abda1355b8035a64/FLAG3d146174e [2024-05-05 15:41:08,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9d19ee182/0625bf9a4c5f41c3abda1355b8035a64 [2024-05-05 15:41:08,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 15:41:08,878 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 15:41:08,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 15:41:08,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 15:41:08,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 15:41:08,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 03:41:08" (1/1) ... [2024-05-05 15:41:08,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277b9451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:08, skipping insertion in model container [2024-05-05 15:41:08,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 03:41:08" (1/1) ... [2024-05-05 15:41:08,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 15:41:09,242 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2024-05-05 15:41:09,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 15:41:09,259 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 15:41:09,301 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2024-05-05 15:41:09,301 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 15:41:09,335 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 15:41:09,335 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 15:41:09,342 INFO L206 MainTranslator]: Completed translation [2024-05-05 15:41:09,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09 WrapperNode [2024-05-05 15:41:09,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 15:41:09,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 15:41:09,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 15:41:09,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 15:41:09,352 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:41:09" (1/1) ... [2024-05-05 15:41:09,383 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:41:09" (1/1) ... [2024-05-05 15:41:09,407 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-05-05 15:41:09,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 15:41:09,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 15:41:09,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 15:41:09,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 15:41:09,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 15:41:09,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 15:41:09,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 15:41:09,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 15:41:09,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (1/1) ... [2024-05-05 15:41:09,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 15:41:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 15:41:09,481 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 15:41:09,505 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 15:41:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-05 15:41:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-05 15:41:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-05 15:41:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-05 15:41:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 15:41:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 15:41:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 15:41:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 15:41:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 15:41:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 15:41:09,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 15:41:09,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 15:41:09,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 15:41:09,539 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 15:41:09,703 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 15:41:09,705 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 15:41:09,877 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 15:41:09,887 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 15:41:09,888 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-05 15:41:09,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 03:41:09 BoogieIcfgContainer [2024-05-05 15:41:09,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 15:41:09,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 15:41:09,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 15:41:09,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 15:41:09,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 03:41:08" (1/3) ... [2024-05-05 15:41:09,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346efaca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 03:41:09, skipping insertion in model container [2024-05-05 15:41:09,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 03:41:09" (2/3) ... [2024-05-05 15:41:09,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346efaca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 03:41:09, skipping insertion in model container [2024-05-05 15:41:09,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 03:41:09" (3/3) ... [2024-05-05 15:41:09,897 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-05-05 15:41:09,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 15:41:09,915 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 15:41:09,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 15:41:09,915 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 15:41:09,966 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-05 15:41:10,005 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 15:41:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 15:41:10,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 15:41:10,012 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 15:41:10,014 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 15:41:10,054 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 15:41:10,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 15:41:10,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 15:41:10,077 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;@587d9b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-05 15:41:10,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-05 15:41:10,121 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 15:41:10,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 15:41:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1929297279, now seen corresponding path program 1 times [2024-05-05 15:41:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 15:41:10,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134378243] [2024-05-05 15:41:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 15:41:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 15:41:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 15:41:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 15:41:10,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 15:41:10,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134378243] [2024-05-05 15:41:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134378243] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 15:41:10,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 15:41:10,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-05 15:41:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952203882] [2024-05-05 15:41:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 15:41:10,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-05 15:41:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 15:41:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-05 15:41:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-05 15:41:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 15:41:10,831 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 15:41:10,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 15:41:10,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 15:41:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-05 15:41:11,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 15:41:11,160 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 15:41:11,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 15:41:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash -895048429, now seen corresponding path program 1 times [2024-05-05 15:41:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 15:41:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711450670] [2024-05-05 15:41:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 15:41:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 15:41:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 15:41:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 15:41:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 15:41:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711450670] [2024-05-05 15:41:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711450670] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 15:41:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 15:41:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-05 15:41:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858178577] [2024-05-05 15:41:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 15:41:11,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-05 15:41:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 15:41:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-05 15:41:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-05 15:41:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 15:41:11,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 15:41:11,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 15:41:11,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-05 15:41:11,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 15:41:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-05 15:41:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 15:41:11,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-05 15:41:11,794 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 15:41:11,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 15:41:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1863394215, now seen corresponding path program 2 times [2024-05-05 15:41:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 15:41:11,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221499233] [2024-05-05 15:41:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 15:41:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 15:41:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 15:41:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 15:41:12,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 15:41:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221499233] [2024-05-05 15:41:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221499233] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 15:41:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797510001] [2024-05-05 15:41:12,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 15:41:12,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 15:41:12,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 15:41:12,087 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 15:41:12,089 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 15:41:12,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 15:41:12,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 15:41:12,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-05 15:41:12,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 15:41:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 15:41:12,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 15:41:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 15:41:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797510001] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 15:41:12,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 15:41:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-05-05 15:41:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320668680] [2024-05-05 15:41:12,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 15:41:12,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-05 15:41:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 15:41:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-05 15:41:12,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-05-05 15:41:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 15:41:12,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 15:41:12,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 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 15:41:12,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-05 15:41:12,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 15:41:12,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 15:41:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-05 15:41:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 15:41:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 15:41:13,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-05 15:41:13,554 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 15:41:13,555 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 15:41:13,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 15:41:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash -806835869, now seen corresponding path program 3 times [2024-05-05 15:41:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 15:41:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629504802] [2024-05-05 15:41:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 15:41:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 15:41:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 15:41:13,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 15:41:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 15:41:13,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 15:41:13,656 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 15:41:13,657 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-05 15:41:13,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-05 15:41:13,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-05 15:41:13,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-05 15:41:13,673 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1] [2024-05-05 15:41:13,678 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 15:41:13,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 15:41:13,731 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-05 15:41:13,735 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-05 15:41:13,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 03:41:13 BasicIcfg [2024-05-05 15:41:13,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 15:41:13,750 INFO L158 Benchmark]: Toolchain (without parser) took 4872.40ms. Allocated memory was 314.6MB in the beginning and 379.6MB in the end (delta: 65.0MB). Free memory was 241.0MB in the beginning and 281.7MB in the end (delta: -40.7MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2024-05-05 15:41:13,750 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 314.6MB. Free memory is still 281.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 15:41:13,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.75ms. Allocated memory is still 314.6MB. Free memory was 240.7MB in the beginning and 221.1MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-05 15:41:13,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.41ms. Allocated memory is still 314.6MB. Free memory was 221.1MB in the beginning and 219.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 15:41:13,751 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 314.6MB. Free memory was 219.0MB in the beginning and 217.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-05 15:41:13,751 INFO L158 Benchmark]: RCFGBuilder took 442.88ms. Allocated memory is still 314.6MB. Free memory was 217.7MB in the beginning and 276.6MB in the end (delta: -58.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-05 15:41:13,752 INFO L158 Benchmark]: TraceAbstraction took 3857.91ms. Allocated memory was 314.6MB in the beginning and 379.6MB in the end (delta: 65.0MB). Free memory was 275.0MB in the beginning and 281.7MB in the end (delta: -6.7MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2024-05-05 15:41:13,753 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.12ms. Allocated memory is still 314.6MB. Free memory is still 281.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.75ms. Allocated memory is still 314.6MB. Free memory was 240.7MB in the beginning and 221.1MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.41ms. Allocated memory is still 314.6MB. Free memory was 221.1MB in the beginning and 219.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 314.6MB. Free memory was 219.0MB in the beginning and 217.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 442.88ms. Allocated memory is still 314.6MB. Free memory was 217.7MB in the beginning and 276.6MB in the end (delta: -58.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3857.91ms. Allocated memory was 314.6MB in the beginning and 379.6MB in the end (delta: 65.0MB). Free memory was 275.0MB in the beginning and 281.7MB in the end (delta: -6.7MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 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: 13115, independent: 12260, independent conditional: 12260, independent unconditional: 0, dependent: 855, dependent conditional: 855, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12304, independent: 12260, independent conditional: 12260, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12304, independent: 12260, independent conditional: 12260, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12304, independent: 12260, independent conditional: 12260, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12460, independent: 12260, independent conditional: 394, independent unconditional: 11866, dependent: 200, dependent conditional: 107, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12460, independent: 12260, independent conditional: 139, independent unconditional: 12121, dependent: 200, dependent conditional: 51, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12460, independent: 12260, independent conditional: 139, independent unconditional: 12121, dependent: 200, dependent conditional: 51, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 371, independent: 336, independent conditional: 19, independent unconditional: 317, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 157, dependent conditional: 114, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12460, independent: 11924, independent conditional: 120, independent unconditional: 11804, dependent: 165, dependent conditional: 19, dependent unconditional: 146, unknown: 371, unknown conditional: 51, unknown unconditional: 320] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 336, Positive conditional cache size: 19, Positive unconditional cache size: 317, Negative cache size: 35, Negative conditional cache size: 32, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 311, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12460, independent: 12260, independent conditional: 394, independent unconditional: 11866, dependent: 200, dependent conditional: 107, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12460, independent: 12260, independent conditional: 139, independent unconditional: 12121, dependent: 200, dependent conditional: 51, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12460, independent: 12260, independent conditional: 139, independent unconditional: 12121, dependent: 200, dependent conditional: 51, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 371, independent: 336, independent conditional: 19, independent unconditional: 317, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 371, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 35, dependent conditional: 32, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 157, dependent conditional: 114, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12460, independent: 11924, independent conditional: 120, independent unconditional: 11804, dependent: 165, dependent conditional: 19, dependent unconditional: 146, unknown: 371, unknown conditional: 51, unknown unconditional: 320] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 336, Positive conditional cache size: 19, Positive unconditional cache size: 317, Negative cache size: 35, Negative conditional cache size: 32, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 311 ], Independence queries for same thread: 811 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=50, argc=50, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=50, arg={0:0}, argc=50, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, i=3, id1={5:0}, id2={3:0}, j=6, k=0] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, i=3, id1={5:0}, id2={3:0}, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=5, k=5] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=5, k=5] [L722] 0 reach_error() VAL [\old(argc)=50, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=50, argv={51:49}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=5, k=5] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.2s, 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: 49, 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, 1.6s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1415 SizeOfPredicates, 6 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/30 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-05 15:41:13,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-05 15:41:13,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...