/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/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-9d61ce8-m [2023-09-06 16:57:08,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-06 16:57:08,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-06 16:57:08,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-06 16:57:08,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-06 16:57:08,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-06 16:57:08,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-06 16:57:08,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-06 16:57:08,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-06 16:57:08,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-06 16:57:08,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-06 16:57:08,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-06 16:57:08,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-06 16:57:08,201 INFO L153 SettingsManager]: * Use SBE=true [2023-09-06 16:57:08,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-06 16:57:08,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-06 16:57:08,202 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-06 16:57:08,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-06 16:57:08,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-06 16:57:08,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-06 16:57:08,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-06 16:57:08,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-06 16:57:08,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-06 16:57:08,204 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-06 16:57:08,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-06 16:57:08,204 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-06 16:57:08,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-06 16:57:08,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-06 16:57:08,209 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-06 16:57:08,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-06 16:57:08,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-06 16:57:08,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-06 16:57:08,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-06 16:57:08,210 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-06 16:57:08,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-06 16:57:08,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-06 16:57:08,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-06 16:57:08,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-06 16:57:08,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-06 16:57:08,211 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-06 16:57:08,211 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-06 16:57:08,212 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-06 16:57:08,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-06 16:57:08,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-06 16:57:08,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-06 16:57:08,415 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-06 16:57:08,415 INFO L274 PluginConnector]: CDTParser initialized [2023-09-06 16:57:08,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2023-09-06 16:57:09,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-06 16:57:09,565 INFO L384 CDTParser]: Found 1 translation units. [2023-09-06 16:57:09,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2023-09-06 16:57:09,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4d1fa32/35fedfec7d61465cb9883859ea277a42/FLAGe6b6f6ad2 [2023-09-06 16:57:09,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4d1fa32/35fedfec7d61465cb9883859ea277a42 [2023-09-06 16:57:09,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-06 16:57:09,598 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-06 16:57:09,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-06 16:57:09,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-06 16:57:09,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-06 16:57:09,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.09 04:57:09" (1/1) ... [2023-09-06 16:57:09,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633fe9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:09, skipping insertion in model container [2023-09-06 16:57:09,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.09 04:57:09" (1/1) ... [2023-09-06 16:57:09,646 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-06 16:57:09,782 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-06 16:57:09,891 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/singleton_with-uninit-problems.i[55568,55581] [2023-09-06 16:57:09,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-06 16:57:09,911 INFO L202 MainTranslator]: Completed pre-run [2023-09-06 16:57:09,922 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-06 16:57:09,939 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [283] [2023-09-06 16:57:09,940 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [283] [2023-09-06 16:57:09,954 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/singleton_with-uninit-problems.i[55568,55581] [2023-09-06 16:57:09,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-06 16:57:10,001 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-06 16:57:10,002 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-06 16:57:10,002 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-06 16:57:10,007 INFO L206 MainTranslator]: Completed translation [2023-09-06 16:57:10,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10 WrapperNode [2023-09-06 16:57:10,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-06 16:57:10,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-06 16:57:10,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-06 16:57:10,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-06 16:57:10,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,055 INFO L138 Inliner]: procedures = 325, calls = 53, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2023-09-06 16:57:10,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-06 16:57:10,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-06 16:57:10,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-06 16:57:10,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-06 16:57:10,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-06 16:57:10,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-06 16:57:10,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-06 16:57:10,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-06 16:57:10,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (1/1) ... [2023-09-06 16:57:10,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-06 16:57:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:10,113 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-06 16:57:10,118 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-06 16:57:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-06 16:57:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-06 16:57:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-06 16:57:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-06 16:57:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-09-06 16:57:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-06 16:57:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-06 16:57:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-06 16:57:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-06 16:57:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-06 16:57:10,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-06 16:57:10,140 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-06 16:57:10,285 INFO L236 CfgBuilder]: Building ICFG [2023-09-06 16:57:10,287 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-06 16:57:10,479 INFO L277 CfgBuilder]: Performing block encoding [2023-09-06 16:57:10,483 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-06 16:57:10,483 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-06 16:57:10,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.09 04:57:10 BoogieIcfgContainer [2023-09-06 16:57:10,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-06 16:57:10,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-06 16:57:10,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-06 16:57:10,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-06 16:57:10,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.09 04:57:09" (1/3) ... [2023-09-06 16:57:10,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264eb2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.09 04:57:10, skipping insertion in model container [2023-09-06 16:57:10,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:57:10" (2/3) ... [2023-09-06 16:57:10,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264eb2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.09 04:57:10, skipping insertion in model container [2023-09-06 16:57:10,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.09 04:57:10" (3/3) ... [2023-09-06 16:57:10,490 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2023-09-06 16:57:10,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-06 16:57:10,502 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-06 16:57:10,502 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-06 16:57:10,503 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-06 16:57:10,598 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-09-06 16:57:10,633 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-06 16:57:10,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-06 16:57:10,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:10,637 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-06 16:57:10,656 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-06 16:57:10,688 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-06 16:57:10,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-06 16:57:10,699 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;@5dcc8dd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-06 16:57:10,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 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 [2023-09-06 16:57:10,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-09-06 16:57:10,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:10,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1613644241, now seen corresponding path program 1 times [2023-09-06 16:57:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801110344] [2023-09-06 16:57:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801110344] [2023-09-06 16:57:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801110344] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:57:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 16:57:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-06 16:57:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448285518] [2023-09-06 16:57:11,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:57:11,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-06 16:57:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:11,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-06 16:57:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-06 16:57:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:11,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:11,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-06 16:57:11,275 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 [2023-09-06 16:57:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:11,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-06 16:57:11,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-09-06 16:57:11,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1659121153, now seen corresponding path program 1 times [2023-09-06 16:57:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659656540] [2023-09-06 16:57:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:11,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659656540] [2023-09-06 16:57:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659656540] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:57:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 16:57:11,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-06 16:57:11,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420513951] [2023-09-06 16:57:11,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:57:11,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-06 16:57:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-06 16:57:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-09-06 16:57:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:11,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:11,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-06 16:57:11,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:11,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:57:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-06 16:57:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-06 16:57:12,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-09-06 16:57:12,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:12,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1050080861, now seen corresponding path program 2 times [2023-09-06 16:57:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791187204] [2023-09-06 16:57:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791187204] [2023-09-06 16:57:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791187204] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:57:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 16:57:12,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-06 16:57:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175325212] [2023-09-06 16:57:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:57:12,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-06 16:57:12,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:12,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-06 16:57:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-06 16:57:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:12,444 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:12,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-06 16:57:12,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:12,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-09-06 16:57:12,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Received shutdown request... [2023-09-06 17:01:56,456 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-06 17:01:56,472 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-06 17:01:56,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-06 17:01:56,727 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2023-09-06 17:01:56,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2023-09-06 17:01:56,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 12 remaining) [2023-09-06 17:01:56,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 12 remaining) [2023-09-06 17:01:56,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 12 remaining) [2023-09-06 17:01:56,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Thread1of1ForFork4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Thread1of1ForFork4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-09-06 17:01:56,730 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-09-06 17:01:56,739 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-09-06 17:01:56,741 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-06 17:01:56,741 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-06 17:01:56,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.09 05:01:56 BasicIcfg [2023-09-06 17:01:56,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-06 17:01:56,744 INFO L158 Benchmark]: Toolchain (without parser) took 287145.41ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 103.5MB in the beginning and 95.8MB in the end (delta: 7.7MB). Peak memory consumption was 138.8MB. Max. memory is 7.0GB. [2023-09-06 17:01:56,744 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-06 17:01:56,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.16ms. Allocated memory is still 161.5MB. Free memory was 103.3MB in the beginning and 115.0MB in the end (delta: -11.7MB). Peak memory consumption was 21.5MB. Max. memory is 7.0GB. [2023-09-06 17:01:56,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.99ms. Allocated memory is still 161.5MB. Free memory was 115.0MB in the beginning and 112.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-06 17:01:56,745 INFO L158 Benchmark]: Boogie Preprocessor took 32.95ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 110.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-06 17:01:56,745 INFO L158 Benchmark]: RCFGBuilder took 396.07ms. Allocated memory is still 161.5MB. Free memory was 110.9MB in the beginning and 94.7MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 7.0GB. [2023-09-06 17:01:56,746 INFO L158 Benchmark]: TraceAbstraction took 286256.79ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 94.1MB in the beginning and 95.8MB in the end (delta: -1.7MB). Peak memory consumption was 127.8MB. Max. memory is 7.0GB. [2023-09-06 17:01:56,747 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.11ms. Allocated memory is still 161.5MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 407.16ms. Allocated memory is still 161.5MB. Free memory was 103.3MB in the beginning and 115.0MB in the end (delta: -11.7MB). Peak memory consumption was 21.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 46.99ms. Allocated memory is still 161.5MB. Free memory was 115.0MB in the beginning and 112.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 32.95ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 110.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 396.07ms. Allocated memory is still 161.5MB. Free memory was 110.9MB in the beginning and 94.7MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 7.0GB. * TraceAbstraction took 286256.79ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 94.1MB in the beginning and 95.8MB in the end (delta: -1.7MB). Peak memory consumption was 127.8MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 283]: Unsoundness Warning unspecified type, defaulting to int C: short [283] - GenericResultAtLocation [Line: 283]: Unsoundness Warning unspecified type, defaulting to int C: short [283] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 5927, independent conditional: 5927, independent unconditional: 0, dependent: 658, dependent conditional: 658, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6157, independent: 5927, independent conditional: 5927, independent unconditional: 0, dependent: 230, dependent conditional: 230, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6157, independent: 5927, independent conditional: 5927, independent unconditional: 0, dependent: 230, dependent conditional: 230, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6846, independent: 5927, independent conditional: 0, independent unconditional: 5927, dependent: 919, dependent conditional: 689, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6846, independent: 5927, independent conditional: 0, independent unconditional: 5927, dependent: 919, dependent conditional: 0, dependent unconditional: 919, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6846, independent: 5927, independent conditional: 0, independent unconditional: 5927, dependent: 919, dependent conditional: 0, dependent unconditional: 919, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6157, independent: 5927, independent conditional: 0, independent unconditional: 5927, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6157, independent: 5913, independent conditional: 0, independent unconditional: 5913, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 244, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 244, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 268, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6846, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 689, dependent conditional: 0, dependent unconditional: 689, unknown: 6157, unknown conditional: 0, unknown unconditional: 6157] , Statistics on independence cache: Total cache size (in pairs): 6157, Positive cache size: 5927, Positive conditional cache size: 0, Positive unconditional cache size: 5927, Negative cache size: 230, Negative conditional cache size: 0, Negative unconditional cache size: 230, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 689, Maximal queried relation: 3, Independence queries for same thread: 428 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 360 - TimeoutResultAtElement [Line: 1147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1151]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1149]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1150]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1152]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1123]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1162]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1150]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1151]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1149]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1152]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 224 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 286.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 284.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: 24, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 could not prove your program: Timeout Completed graceful shutdown