/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 22:37:44,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 22:37:44,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 22:37:44,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 22:37:44,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 22:37:44,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 22:37:44,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 22:37:44,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 22:37:44,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 22:37:44,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 22:37:44,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 22:37:44,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 22:37:44,425 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 22:37:44,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 22:37:44,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 22:37:44,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 22:37:44,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 22:37:44,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 22:37:44,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 22:37:44,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 22:37:44,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 22:37:44,429 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 22:37:44,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 22:37:44,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 22:37:44,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 22:37:44,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 22:37:44,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 22:37:44,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 22:37:44,430 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 22:37:44,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 22:37:44,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 22:37:44,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 22:37:44,431 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 22:37:44,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 22:37:44,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 22:37:44,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 22:37:44,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 22:37:44,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 22:37:44,672 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 22:37:44,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-06 22:37:45,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 22:37:45,879 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 22:37:45,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-06 22:37:45,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/65ecf044d/828975b2a02d475f9d8d4491869fde1c/FLAG03a5fbdfe [2024-05-06 22:37:45,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/65ecf044d/828975b2a02d475f9d8d4491869fde1c [2024-05-06 22:37:45,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 22:37:45,907 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 22:37:45,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 22:37:45,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 22:37:45,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 22:37:45,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 10:37:45" (1/1) ... [2024-05-06 22:37:45,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bce722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:45, skipping insertion in model container [2024-05-06 22:37:45,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 10:37:45" (1/1) ... [2024-05-06 22:37:45,928 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 22:37:46,040 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-06 22:37:46,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 22:37:46,050 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 22:37:46,064 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-06 22:37:46,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 22:37:46,070 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 22:37:46,070 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 22:37:46,075 INFO L206 MainTranslator]: Completed translation [2024-05-06 22:37:46,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46 WrapperNode [2024-05-06 22:37:46,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 22:37:46,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 22:37:46,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 22:37:46,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 22:37:46,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,098 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-05-06 22:37:46,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 22:37:46,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 22:37:46,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 22:37:46,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 22:37:46,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 22:37:46,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 22:37:46,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 22:37:46,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 22:37:46,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (1/1) ... [2024-05-06 22:37:46,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 22:37:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:37:46,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 22:37:46,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 22:37:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 22:37:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 22:37:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 22:37:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 22:37:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 22:37:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 22:37:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 22:37:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 22:37:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 22:37:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 22:37:46,201 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 22:37:46,263 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 22:37:46,265 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 22:37:46,395 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 22:37:46,438 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 22:37:46,438 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-06 22:37:46,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 10:37:46 BoogieIcfgContainer [2024-05-06 22:37:46,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 22:37:46,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 22:37:46,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 22:37:46,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 22:37:46,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 10:37:45" (1/3) ... [2024-05-06 22:37:46,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbf6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 10:37:46, skipping insertion in model container [2024-05-06 22:37:46,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 10:37:46" (2/3) ... [2024-05-06 22:37:46,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbf6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 10:37:46, skipping insertion in model container [2024-05-06 22:37:46,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 10:37:46" (3/3) ... [2024-05-06 22:37:46,452 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-05-06 22:37:46,458 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 22:37:46,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 22:37:46,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 22:37:46,465 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 22:37:46,545 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-06 22:37:46,590 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 22:37:46,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 22:37:46,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:37:46,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 22:37:46,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 22:37:46,658 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 22:37:46,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:37:46,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 22:37:46,676 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f35e7c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 22:37:46,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 22:37:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 1 times [2024-05-06 22:37:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:47,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 2 times [2024-05-06 22:37:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:48,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 3 times [2024-05-06 22:37:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:49,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 4 times [2024-05-06 22:37:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:49,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 1 times [2024-05-06 22:37:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 603896095, now seen corresponding path program 2 times [2024-05-06 22:37:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 22:37:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 22:37:51,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 22:37:51,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:37:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1121987728, now seen corresponding path program 1 times [2024-05-06 22:37:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:37:51,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034035547] [2024-05-06 22:37:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 22:37:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:37:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034035547] [2024-05-06 22:37:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034035547] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 22:37:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 22:37:51,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 22:37:51,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560844265] [2024-05-06 22:37:51,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 22:37:51,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 22:37:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:37:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 22:37:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 22:37:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:52,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:37:52,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 22:37:52,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 5 times [2024-05-06 22:37:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:52,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 6 times [2024-05-06 22:37:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:52,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 7 times [2024-05-06 22:37:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:52,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 8 times [2024-05-06 22:37:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:53,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 3 times [2024-05-06 22:37:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash 603896095, now seen corresponding path program 4 times [2024-05-06 22:37:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 22:37:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 22:37:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:55,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-06 22:37:55,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 22:37:55,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:37:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1005987980, now seen corresponding path program 1 times [2024-05-06 22:37:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:37:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092930880] [2024-05-06 22:37:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:37:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092930880] [2024-05-06 22:37:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092930880] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:37:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096933260] [2024-05-06 22:37:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:37:55,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:37:55,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 22:37:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 22:37:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:55,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-06 22:37:55,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:37:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 22:37:55,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 22:37:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096933260] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 22:37:55,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 22:37:55,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2024-05-06 22:37:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255606261] [2024-05-06 22:37:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 22:37:55,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 22:37:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:37:55,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 22:37:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-06 22:37:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:55,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:37:55,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 22:37:55,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:55,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash 530136904, now seen corresponding path program 1 times [2024-05-06 22:37:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:56,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 848385164, now seen corresponding path program 2 times [2024-05-06 22:37:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1527607113, now seen corresponding path program 3 times [2024-05-06 22:37:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1336195669, now seen corresponding path program 4 times [2024-05-06 22:37:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:37:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:37:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1656362122, now seen corresponding path program 1 times [2024-05-06 22:37:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 22:37:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1161809674, now seen corresponding path program 2 times [2024-05-06 22:37:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:37:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:37:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:37:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:37:59,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 22:37:59,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable17 [2024-05-06 22:37:59,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 22:37:59,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:37:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1498311593, now seen corresponding path program 1 times [2024-05-06 22:37:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:37:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423079204] [2024-05-06 22:37:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:37:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:37:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:38:00,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:38:00,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423079204] [2024-05-06 22:38:00,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423079204] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:38:00,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173630614] [2024-05-06 22:38:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:38:00,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:38:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:38:00,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 22:38:00,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-06 22:38:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:00,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-06 22:38:00,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:38:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 22:38:01,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 22:38:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:38:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173630614] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 22:38:02,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 22:38:02,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2024-05-06 22:38:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008292201] [2024-05-06 22:38:02,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 22:38:02,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-05-06 22:38:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:38:02,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-05-06 22:38:02,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2024-05-06 22:38:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:02,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:38:02,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.484848484848484) internal successors, (148), 33 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 22:38:02,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:02,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:38:02,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:07,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:38:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1107375314, now seen corresponding path program 3 times [2024-05-06 22:38:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:38:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:38:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 142 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-05-06 22:38:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:38:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:38:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 33 proven. 134 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-06 22:38:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1096394527, now seen corresponding path program 4 times [2024-05-06 22:38:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:38:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:38:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 142 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-05-06 22:38:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:38:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:38:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 12 proven. 157 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-06 22:38:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:38:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-06 22:38:37,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-06 22:38:37,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 22:38:37,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 22:38:37,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:38:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash -541022233, now seen corresponding path program 2 times [2024-05-06 22:38:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:38:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065510100] [2024-05-06 22:38:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:38:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:38:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:38:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 126 proven. 97 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-06 22:38:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:38:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065510100] [2024-05-06 22:38:44,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065510100] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:38:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309220964] [2024-05-06 22:38:44,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 22:38:44,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:38:44,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:38:44,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 22:38:44,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-06 22:38:44,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 22:38:44,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 22:38:44,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-06 22:38:44,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:38:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 81 proven. 49 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-05-06 22:38:44,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 22:38:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-05-06 22:38:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309220964] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 22:38:44,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 22:38:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9, 6] total 39 [2024-05-06 22:38:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399612101] [2024-05-06 22:38:44,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 22:38:44,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-06 22:38:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:38:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-06 22:38:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1345, Unknown=0, NotChecked=0, Total=1482 [2024-05-06 22:38:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:44,905 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:38:44,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.0) internal successors, (195), 39 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 22:38:44,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:44,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:38:44,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-06 22:38:44,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:38:51,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:39:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1232056083, now seen corresponding path program 5 times [2024-05-06 22:39:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:00,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash -607479022, now seen corresponding path program 6 times [2024-05-06 22:39:02,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:02,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1104649684, now seen corresponding path program 7 times [2024-05-06 22:39:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:03,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1584897451, now seen corresponding path program 8 times [2024-05-06 22:39:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:04,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 245706948, now seen corresponding path program 9 times [2024-05-06 22:39:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:06,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1606414308, now seen corresponding path program 10 times [2024-05-06 22:39:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:06,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1622831005, now seen corresponding path program 11 times [2024-05-06 22:39:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:09,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1606321982, now seen corresponding path program 12 times [2024-05-06 22:39:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:09,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 22:39:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 22:39:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:39:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:39:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-05-06 22:39:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-05-06 22:39:12,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-06 22:39:12,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-06 22:39:12,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 22:39:12,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 22:39:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash 308048458, now seen corresponding path program 3 times [2024-05-06 22:39:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 22:39:12,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717285813] [2024-05-06 22:39:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 22:39:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 22:39:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 22:39:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 188 proven. 83 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-05-06 22:39:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 22:39:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717285813] [2024-05-06 22:39:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717285813] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 22:39:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822932805] [2024-05-06 22:39:15,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 22:39:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 22:39:15,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 22:39:15,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 22:39:15,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-06 22:39:15,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-05-06 22:39:15,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 22:39:15,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-06 22:39:15,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 22:43:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 156 proven. 115 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-05-06 22:43:25,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 22:43:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 10 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 22:43:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822932805] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 22:43:37,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 22:43:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33, 50] total 117 [2024-05-06 22:43:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309107127] [2024-05-06 22:43:37,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 22:43:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2024-05-06 22:43:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 22:43:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2024-05-06 22:43:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2025, Invalid=11512, Unknown=35, NotChecked=0, Total=13572 [2024-05-06 22:43:37,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:43:37,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 22:43:37,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.393162393162393) internal successors, (280), 117 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 22:43:37,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:43:37,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 22:43:37,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-05-06 22:43:37,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2024-05-06 22:43:37,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 22:44:40,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:05,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:17,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:18,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:28,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:30,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:47,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:45:57,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:46:04,115 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 95 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:46:08,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:46:10,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:46:26,773 WARN L293 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 84 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:46:43,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:47:13,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:47:39,070 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 258 DAG size of output: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:47:51,837 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 264 DAG size of output: 119 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:48:24,711 WARN L293 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 256 DAG size of output: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:48:43,193 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 262 DAG size of output: 130 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:51:00,213 WARN L293 SmtUtils]: Spent 9.62s on a formula simplification. DAG size of input: 181 DAG size of output: 179 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-06 22:52:04,314 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 22:52:04,314 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-05-06 22:52:04,325 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 22:52:04,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-06 22:52:05,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-05-06 22:52:05,098 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 256 known predicates. [2024-05-06 22:52:05,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 22:52:05,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 22:52:05,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 22:52:05,101 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 22:52:05,104 INFO L448 BasicCegarLoop]: Path program histogram: [12, 8, 4, 4, 3, 1, 1] [2024-05-06 22:52:05,106 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 22:52:05,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 22:52:05,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 10:52:05 BasicIcfg [2024-05-06 22:52:05,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 22:52:05,108 INFO L158 Benchmark]: Toolchain (without parser) took 859201.14ms. Allocated memory was 257.9MB in the beginning and 918.6MB in the end (delta: 660.6MB). Free memory was 187.1MB in the beginning and 478.2MB in the end (delta: -291.2MB). Peak memory consumption was 370.9MB. Max. memory is 8.0GB. [2024-05-06 22:52:05,108 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 257.9MB. Free memory was 226.2MB in the beginning and 226.0MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 22:52:05,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.48ms. Allocated memory is still 257.9MB. Free memory was 187.1MB in the beginning and 175.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-06 22:52:05,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.96ms. Allocated memory is still 257.9MB. Free memory was 175.5MB in the beginning and 173.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 22:52:05,108 INFO L158 Benchmark]: Boogie Preprocessor took 16.64ms. Allocated memory is still 257.9MB. Free memory was 173.8MB in the beginning and 172.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 22:52:05,109 INFO L158 Benchmark]: RCFGBuilder took 322.26ms. Allocated memory is still 257.9MB. Free memory was 172.4MB in the beginning and 154.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-05-06 22:52:05,109 INFO L158 Benchmark]: TraceAbstraction took 858662.21ms. Allocated memory was 257.9MB in the beginning and 918.6MB in the end (delta: 660.6MB). Free memory was 152.8MB in the beginning and 478.2MB in the end (delta: -325.4MB). Peak memory consumption was 336.3MB. Max. memory is 8.0GB. [2024-05-06 22:52:05,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 257.9MB. Free memory was 226.2MB in the beginning and 226.0MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.48ms. Allocated memory is still 257.9MB. Free memory was 187.1MB in the beginning and 175.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.96ms. Allocated memory is still 257.9MB. Free memory was 175.5MB in the beginning and 173.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.64ms. Allocated memory is still 257.9MB. Free memory was 173.8MB in the beginning and 172.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 322.26ms. Allocated memory is still 257.9MB. Free memory was 172.4MB in the beginning and 154.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 858662.21ms. Allocated memory was 257.9MB in the beginning and 918.6MB in the end (delta: 660.6MB). Free memory was 152.8MB in the beginning and 478.2MB in the end (delta: -325.4MB). Peak memory consumption was 336.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10812, independent: 9761, independent conditional: 7933, independent unconditional: 1828, dependent: 1021, dependent conditional: 1003, dependent unconditional: 18, unknown: 30, unknown conditional: 21, unknown unconditional: 9] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9871, independent: 9761, independent conditional: 7933, independent unconditional: 1828, dependent: 80, dependent conditional: 62, dependent unconditional: 18, unknown: 30, unknown conditional: 21, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9871, independent: 9761, independent conditional: 7933, independent unconditional: 1828, dependent: 80, dependent conditional: 62, dependent unconditional: 18, unknown: 30, unknown conditional: 21, unknown unconditional: 9] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9871, independent: 9761, independent conditional: 7933, independent unconditional: 1828, dependent: 80, dependent conditional: 62, dependent unconditional: 18, unknown: 30, unknown conditional: 21, unknown unconditional: 9] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10054, independent: 9761, independent conditional: 2521, independent unconditional: 7240, dependent: 224, dependent conditional: 100, dependent unconditional: 124, unknown: 69, unknown conditional: 29, unknown unconditional: 40] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10054, independent: 9761, independent conditional: 2348, independent unconditional: 7413, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 69, unknown conditional: 20, unknown unconditional: 49] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10054, independent: 9761, independent conditional: 2348, independent unconditional: 7413, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 69, unknown conditional: 20, unknown unconditional: 49] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 32, dependent conditional: 27, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 27, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 27, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4788, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 728, dependent conditional: 650, dependent unconditional: 78, unknown: 4061, unknown conditional: 3045, unknown unconditional: 1016] , Protected Queries: 0 ], Cache Queries: [ total: 10054, independent: 9390, independent conditional: 2348, independent unconditional: 7042, dependent: 192, dependent conditional: 40, dependent unconditional: 152, unknown: 472, unknown conditional: 47, unknown unconditional: 425] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 32, Negative conditional cache size: 27, Negative unconditional cache size: 5, Unknown cache size: 4, Unknown conditional cache size: 3, Unknown unconditional cache size: 1, Eliminated conditions: 215, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10054, independent: 9761, independent conditional: 2521, independent unconditional: 7240, dependent: 224, dependent conditional: 100, dependent unconditional: 124, unknown: 69, unknown conditional: 29, unknown unconditional: 40] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10054, independent: 9761, independent conditional: 2348, independent unconditional: 7413, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 69, unknown conditional: 20, unknown unconditional: 49] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10054, independent: 9761, independent conditional: 2348, independent unconditional: 7413, dependent: 224, dependent conditional: 67, dependent unconditional: 157, unknown: 69, unknown conditional: 20, unknown unconditional: 49] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 32, dependent conditional: 27, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 407, independent: 371, independent conditional: 0, independent unconditional: 371, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 27, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 27, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4788, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 728, dependent conditional: 650, dependent unconditional: 78, unknown: 4061, unknown conditional: 3045, unknown unconditional: 1016] , Protected Queries: 0 ], Cache Queries: [ total: 10054, independent: 9390, independent conditional: 2348, independent unconditional: 7042, dependent: 192, dependent conditional: 40, dependent unconditional: 152, unknown: 472, unknown conditional: 47, unknown unconditional: 425] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 32, Negative conditional cache size: 27, Negative unconditional cache size: 5, Unknown cache size: 4, Unknown conditional cache size: 3, Unknown unconditional cache size: 1, Eliminated conditions: 215 ], Independence queries for same thread: 941 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 256 known predicates. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 256 known predicates. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 256 known predicates. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 256 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 858.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 580.6s, 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: 372, 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.6s SatisfiabilityAnalysisTime, 275.9s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1279 ConstructedInterpolants, 0 QuantifiedInterpolants, 15231 SizeOfPredicates, 33 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1776 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 33.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 28, ConditionalCommutativityTraceChecks: 28, ConditionalCommutativityImperfectProofs: 8 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown