/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-fffa3fa-m [2023-09-05 00:12:12,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-05 00:12:12,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-05 00:12:12,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-05 00:12:12,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-05 00:12:12,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-05 00:12:12,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-05 00:12:12,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-05 00:12:12,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-05 00:12:12,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-05 00:12:12,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-05 00:12:12,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-05 00:12:12,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-05 00:12:12,373 INFO L153 SettingsManager]: * Use SBE=true [2023-09-05 00:12:12,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-05 00:12:12,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-05 00:12:12,374 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-05 00:12:12,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-05 00:12:12,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-05 00:12:12,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-05 00:12:12,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-05 00:12:12,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-05 00:12:12,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-05 00:12:12,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-05 00:12:12,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-05 00:12:12,377 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-05 00:12:12,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-05 00:12:12,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-05 00:12:12,378 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-05 00:12:12,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-05 00:12:12,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-05 00:12:12,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-05 00:12:12,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-05 00:12:12,379 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-05 00:12:12,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-05 00:12:12,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-05 00:12:12,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-05 00:12:12,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-05 00:12:12,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-05 00:12:12,380 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-05 00:12:12,381 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-05 00:12:12,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-09-05 00:12:12,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-05 00:12:12,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-05 00:12:12,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-05 00:12:12,621 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-05 00:12:12,621 INFO L274 PluginConnector]: CDTParser initialized [2023-09-05 00:12:12,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-09-05 00:12:13,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-05 00:12:14,074 INFO L384 CDTParser]: Found 1 translation units. [2023-09-05 00:12:14,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-09-05 00:12:14,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a395744b8/142f2fc0f65a497e834448e5f4c5bde8/FLAGaa91748b7 [2023-09-05 00:12:14,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a395744b8/142f2fc0f65a497e834448e5f4c5bde8 [2023-09-05 00:12:14,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-05 00:12:14,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-05 00:12:14,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-05 00:12:14,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-05 00:12:14,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-05 00:12:14,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a10bcb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14, skipping insertion in model container [2023-09-05 00:12:14,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,170 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-09-05 00:12:14,510 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-deagle/arithmetic_prog_bad.i[39758,39771] [2023-09-05 00:12:14,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-05 00:12:14,524 INFO L201 MainTranslator]: Completed pre-run [2023-09-05 00:12:14,539 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [218] [2023-09-05 00:12:14,540 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [219] [2023-09-05 00:12:14,551 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [730] [2023-09-05 00:12:14,557 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [871] [2023-09-05 00:12:14,564 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-deagle/arithmetic_prog_bad.i[39758,39771] [2023-09-05 00:12:14,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-05 00:12:14,620 INFO L206 MainTranslator]: Completed translation [2023-09-05 00:12:14,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14 WrapperNode [2023-09-05 00:12:14,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-05 00:12:14,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-05 00:12:14,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-05 00:12:14,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-05 00:12:14,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,675 INFO L138 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-09-05 00:12:14,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-05 00:12:14,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-05 00:12:14,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-05 00:12:14,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-05 00:12:14,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-05 00:12:14,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-05 00:12:14,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-05 00:12:14,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-05 00:12:14,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (1/1) ... [2023-09-05 00:12:14,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-05 00:12:14,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:14,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-05 00:12:14,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-05 00:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-05 00:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-05 00:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-09-05 00:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-05 00:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-05 00:12:14,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-05 00:12:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-05 00:12:14,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-05 00:12:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-05 00:12:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-05 00:12:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-05 00:12:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-05 00:12:14,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-05 00:12:14,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-05 00:12:14,801 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-05 00:12:14,967 INFO L236 CfgBuilder]: Building ICFG [2023-09-05 00:12:14,968 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-05 00:12:15,190 INFO L277 CfgBuilder]: Performing block encoding [2023-09-05 00:12:15,197 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-05 00:12:15,197 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-05 00:12:15,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:12:15 BoogieIcfgContainer [2023-09-05 00:12:15,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-05 00:12:15,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-05 00:12:15,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-05 00:12:15,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-05 00:12:15,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:12:14" (1/3) ... [2023-09-05 00:12:15,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415cfa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:12:15, skipping insertion in model container [2023-09-05 00:12:15,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:12:14" (2/3) ... [2023-09-05 00:12:15,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415cfa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:12:15, skipping insertion in model container [2023-09-05 00:12:15,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:12:15" (3/3) ... [2023-09-05 00:12:15,206 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2023-09-05 00:12:15,212 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-05 00:12:15,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-05 00:12:15,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-05 00:12:15,225 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-05 00:12:15,307 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-05 00:12:15,354 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-05 00:12:15,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-05 00:12:15,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:15,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-05 00:12:15,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-05 00:12:15,421 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-05 00:12:15,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-05 00:12:15,436 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;@34f79b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-05 00:12:15,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 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 [2023-09-05 00:12:15,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-05 00:12:15,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2010424747, now seen corresponding path program 1 times [2023-09-05 00:12:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:15,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46837770] [2023-09-05 00:12:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-09-05 00:12:16,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46837770] [2023-09-05 00:12:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46837770] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-05 00:12:16,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-05 00:12:16,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-05 00:12:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229701871] [2023-09-05 00:12:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:16,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-05 00:12:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:16,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-05 00:12:16,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-05 00:12:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:16,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:16,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:16,224 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 [2023-09-05 00:12:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:16,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-05 00:12:16,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-05 00:12:16,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1781420652, now seen corresponding path program 2 times [2023-09-05 00:12:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065761978] [2023-09-05 00:12:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-09-05 00:12:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065761978] [2023-09-05 00:12:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065761978] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-05 00:12:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-05 00:12:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-05 00:12:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774961519] [2023-09-05 00:12:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-05 00:12:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-05 00:12:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-05 00:12:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:16,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:16,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:16,522 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 [2023-09-05 00:12:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:16,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-05 00:12:16,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-05 00:12:16,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1149392253, now seen corresponding path program 3 times [2023-09-05 00:12:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591356824] [2023-09-05 00:12:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-09-05 00:12:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591356824] [2023-09-05 00:12:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591356824] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-05 00:12:16,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-05 00:12:16,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-05 00:12:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616557215] [2023-09-05 00:12:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-05 00:12:16,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-05 00:12:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-05 00:12:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-05 00:12:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:16,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:16,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:16,938 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 [2023-09-05 00:12:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-05 00:12:17,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-05 00:12:17,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash 67743663, now seen corresponding path program 4 times [2023-09-05 00:12:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:17,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365448106] [2023-09-05 00:12:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-05 00:12:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-05 00:12:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-05 00:12:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365448106] [2023-09-05 00:12:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365448106] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-05 00:12:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6199043] [2023-09-05 00:12:17,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-05 00:12:17,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-05 00:12:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-05 00:12:17,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-05 00:12:17,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-05 00:12:17,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-05 00:12:17,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-05 00:12:17,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-05 00:12:17,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-05 00:12:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-05 00:12:17,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-05 00:12:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-05 00:12:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6199043] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-05 00:12:17,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-05 00:12:17,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-09-05 00:12:17,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359566007] [2023-09-05 00:12:17,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-05 00:12:17,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-05 00:12:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-05 00:12:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-05 00:12:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-05 00:12:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-05 00:12:17,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-05 00:12:17,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-05 00:12:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,681 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 [2023-09-05 00:12:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-05 00:12:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-05 00:12:17,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:17,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-09-05 00:12:17,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-05 00:12:17,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-05 00:12:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1788440699, now seen corresponding path program 5 times [2023-09-05 00:12:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-05 00:12:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65127821] [2023-09-05 00:12:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-05 00:12:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-05 00:12:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-05 00:12:18,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-05 00:12:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-05 00:12:18,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-05 00:12:18,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-05 00:12:18,172 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-09-05 00:12:18,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-09-05 00:12:18,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-09-05 00:12:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-05 00:12:18,177 INFO L445 BasicCegarLoop]: Path program histogram: [5] [2023-09-05 00:12:18,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-05 00:12:18,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-05 00:12:18,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:12:18 BasicIcfg [2023-09-05 00:12:18,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-05 00:12:18,289 INFO L158 Benchmark]: Toolchain (without parser) took 4175.46ms. Allocated memory was 275.8MB in the beginning and 340.8MB in the end (delta: 65.0MB). Free memory was 226.0MB in the beginning and 210.8MB in the end (delta: 15.2MB). Peak memory consumption was 81.5MB. Max. memory is 7.0GB. [2023-09-05 00:12:18,290 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-05 00:12:18,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.62ms. Allocated memory is still 275.8MB. Free memory was 225.8MB in the beginning and 199.1MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 7.0GB. [2023-09-05 00:12:18,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.07ms. Allocated memory is still 275.8MB. Free memory was 199.1MB in the beginning and 197.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-05 00:12:18,290 INFO L158 Benchmark]: Boogie Preprocessor took 45.76ms. Allocated memory is still 275.8MB. Free memory was 196.6MB in the beginning and 194.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-05 00:12:18,291 INFO L158 Benchmark]: RCFGBuilder took 476.90ms. Allocated memory is still 275.8MB. Free memory was 194.9MB in the beginning and 177.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 7.0GB. [2023-09-05 00:12:18,291 INFO L158 Benchmark]: TraceAbstraction took 3088.28ms. Allocated memory was 275.8MB in the beginning and 340.8MB in the end (delta: 65.0MB). Free memory was 177.1MB in the beginning and 210.8MB in the end (delta: -33.7MB). Peak memory consumption was 32.2MB. Max. memory is 7.0GB. [2023-09-05 00:12:18,295 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.13ms. Allocated memory is still 170.9MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 508.62ms. Allocated memory is still 275.8MB. Free memory was 225.8MB in the beginning and 199.1MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 51.07ms. Allocated memory is still 275.8MB. Free memory was 199.1MB in the beginning and 197.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 45.76ms. Allocated memory is still 275.8MB. Free memory was 196.6MB in the beginning and 194.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 476.90ms. Allocated memory is still 275.8MB. Free memory was 194.9MB in the beginning and 177.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 7.0GB. * TraceAbstraction took 3088.28ms. Allocated memory was 275.8MB in the beginning and 340.8MB in the end (delta: 65.0MB). Free memory was 177.1MB in the beginning and 210.8MB in the end (delta: -33.7MB). Peak memory consumption was 32.2MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 218]: Unsoundness Warning unspecified type, defaulting to int C: short [218] - GenericResultAtLocation [Line: 219]: Unsoundness Warning unspecified type, defaulting to int C: short [219] - GenericResultAtLocation [Line: 730]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [730] - GenericResultAtLocation [Line: 871]: Unsoundness Warning unspecified type, defaulting to int C: unsigned long [871] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 822, independent: 708, independent conditional: 708, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 734, independent: 708, independent conditional: 708, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 734, independent: 708, independent conditional: 708, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 776, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 68, dependent conditional: 42, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 776, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 734, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 734, independent: 691, independent conditional: 0, independent unconditional: 691, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 43, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 776, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 734, unknown conditional: 0, unknown unconditional: 734] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 708, Positive conditional cache size: 0, Positive unconditional cache size: 708, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 4, Independence queries for same thread: 88 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; VAL [num=0] [L871] 0 unsigned long total; VAL [num=0, total=0] [L872] 0 int flag; VAL [flag=0, num=0, total=0] [L873] 0 pthread_mutex_t m; VAL [flag=0, m={3:0}, num=0, total=0] [L874] 0 pthread_cond_t empty, full; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L907] 0 pthread_t t1, t2; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={7:0}, t2={6:0}, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t2, 0, thread2, 0)=-1, t1={7:0}, t2={6:0}, total=0] [L915] 0 \read(t1) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L880] COND TRUE 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L880] COND TRUE 1 num > 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L890] 2 int j; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=0, m={3:0}, num=1, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L894] COND TRUE 2 num == 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L916] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L896] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 167 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.7s, 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: 17, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 979 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 961 ConstructedInterpolants, 0 QuantifiedInterpolants, 1275 SizeOfPredicates, 5 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 562/571 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-05 00:12:18,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-09-05 00:12:18,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...