/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --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-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 07:27:10,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 07:27:10,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 07:27:10,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 07:27:10,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 07:27:10,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 07:27:10,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 07:27:10,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 07:27:10,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 07:27:10,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 07:27:10,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 07:27:10,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 07:27:10,891 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 07:27:10,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 07:27:10,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 07:27:10,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 07:27:10,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 07:27:10,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 07:27:10,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 07:27:10,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 07:27:10,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 07:27:10,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 07:27:10,895 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 07:27:10,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 07:27:10,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 07:27:10,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 07:27:10,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 07:27:10,895 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 07:27:10,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 07:27:10,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 07:27:10,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 07:27:10,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 07:27:10,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 07:27:10,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 07:27:10,897 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 07:27:10,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 07:27:10,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 07:27:10,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 07:27:10,898 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 07:27:10,898 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP 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-08 07:27:11,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 07:27:11,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 07:27:11,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 07:27:11,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 07:27:11,139 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 07:27:11,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-05-08 07:27:12,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 07:27:12,325 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 07:27:12,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-05-08 07:27:12,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29064cc6f/af8713cbc33e45f88cbe7abab5cfb028/FLAGb546f78bd [2024-05-08 07:27:12,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29064cc6f/af8713cbc33e45f88cbe7abab5cfb028 [2024-05-08 07:27:12,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 07:27:12,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 07:27:12,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 07:27:12,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 07:27:12,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 07:27:12,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702c3517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12, skipping insertion in model container [2024-05-08 07:27:12,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,375 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 07:27:12,515 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-bad-threaded-sum-2.wvr.c[2476,2489] [2024-05-08 07:27:12,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 07:27:12,530 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 07:27:12,561 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-bad-threaded-sum-2.wvr.c[2476,2489] [2024-05-08 07:27:12,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 07:27:12,567 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 07:27:12,567 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 07:27:12,573 INFO L206 MainTranslator]: Completed translation [2024-05-08 07:27:12,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12 WrapperNode [2024-05-08 07:27:12,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 07:27:12,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 07:27:12,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 07:27:12,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 07:27:12,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,612 INFO L138 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-05-08 07:27:12,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 07:27:12,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 07:27:12,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 07:27:12,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 07:27:12,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 07:27:12,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 07:27:12,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 07:27:12,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 07:27:12,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (1/1) ... [2024-05-08 07:27:12,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 07:27:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:27:12,711 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-08 07:27:12,720 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-08 07:27:12,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 07:27:12,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-08 07:27:12,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-08 07:27:12,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-08 07:27:12,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-08 07:27:12,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 07:27:12,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 07:27:12,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 07:27:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 07:27:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 07:27:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 07:27:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 07:27:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 07:27:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 07:27:12,754 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 07:27:12,846 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 07:27:12,848 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 07:27:13,047 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 07:27:13,096 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 07:27:13,097 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-08 07:27:13,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 07:27:13 BoogieIcfgContainer [2024-05-08 07:27:13,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 07:27:13,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 07:27:13,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 07:27:13,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 07:27:13,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 07:27:12" (1/3) ... [2024-05-08 07:27:13,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23349eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 07:27:13, skipping insertion in model container [2024-05-08 07:27:13,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:27:12" (2/3) ... [2024-05-08 07:27:13,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23349eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 07:27:13, skipping insertion in model container [2024-05-08 07:27:13,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 07:27:13" (3/3) ... [2024-05-08 07:27:13,104 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2024-05-08 07:27:13,110 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 07:27:13,117 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 07:27:13,117 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 07:27:13,117 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 07:27:13,184 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-08 07:27:13,215 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 07:27:13,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 07:27:13,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:27:13,216 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-08 07:27:13,217 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-08 07:27:13,247 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 07:27:13,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:27:13,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 07:27:13,263 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;@1a40b43a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=LOOP, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 07:27:13,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-08 07:27:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1348769446, now seen corresponding path program 1 times [2024-05-08 07:27:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:27:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:27:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 07:27:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 07:27:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2147115657, now seen corresponding path program 1 times [2024-05-08 07:27:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:14,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash -100558949, now seen corresponding path program 1 times [2024-05-08 07:27:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:14,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1177640107, now seen corresponding path program 2 times [2024-05-08 07:27:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:27:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:27:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-08 07:27:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-08 07:27:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2147115657, now seen corresponding path program 2 times [2024-05-08 07:27:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:15,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash -100558949, now seen corresponding path program 3 times [2024-05-08 07:27:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:15,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2147105187, now seen corresponding path program 3 times [2024-05-08 07:27:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:15,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:15,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 07:27:15,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:27:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -609160435, now seen corresponding path program 1 times [2024-05-08 07:27:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:27:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770069793] [2024-05-08 07:27:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:27:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:27:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770069793] [2024-05-08 07:27:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770069793] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 07:27:15,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 07:27:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 07:27:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628164589] [2024-05-08 07:27:15,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 07:27:15,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 07:27:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:27:15,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 07:27:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-05-08 07:27:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:15,934 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:27:15,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-08 07:27:15,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 558957123, now seen corresponding path program 1 times [2024-05-08 07:27:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:16,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1645272533, now seen corresponding path program 2 times [2024-05-08 07:27:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:16,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash 558946653, now seen corresponding path program 3 times [2024-05-08 07:27:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:16,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:16,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9 [2024-05-08 07:27:16,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 07:27:16,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:27:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -17791673, now seen corresponding path program 1 times [2024-05-08 07:27:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:27:16,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546513057] [2024-05-08 07:27:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:16,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:27:17,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:27:17,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546513057] [2024-05-08 07:27:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546513057] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 07:27:17,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929780442] [2024-05-08 07:27:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:17,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 07:27:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:27:17,518 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-08 07:27:17,532 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-08 07:27:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:17,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 07:27:17,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 07:27:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:27:18,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 07:27:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:27:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929780442] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 07:27:19,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 07:27:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 37 [2024-05-08 07:27:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782162854] [2024-05-08 07:27:19,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 07:27:19,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-08 07:27:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:27:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-08 07:27:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2024-05-08 07:27:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:19,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:27:19,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.45945945945946) internal successors, (165), 37 states have internal predecessors, (165), 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-08 07:27:19,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:19,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash -53736182, now seen corresponding path program 4 times [2024-05-08 07:27:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:24,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash -100855742, now seen corresponding path program 5 times [2024-05-08 07:27:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:24,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1727536601, now seen corresponding path program 6 times [2024-05-08 07:27:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:24,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-05-08 07:27:25,127 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-08 07:27:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-08 07:27:25,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 07:27:25,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:27:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1515431565, now seen corresponding path program 2 times [2024-05-08 07:27:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:27:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956571484] [2024-05-08 07:27:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-08 07:27:25,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:27:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956571484] [2024-05-08 07:27:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956571484] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 07:27:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372184401] [2024-05-08 07:27:25,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 07:27:25,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 07:27:25,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:27:25,597 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-08 07:27:25,612 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-08 07:27:25,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 07:27:25,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 07:27:25,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-08 07:27:25,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 07:27:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-05-08 07:27:25,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 07:27:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-08 07:27:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372184401] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 07:27:25,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 07:27:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 15 [2024-05-08 07:27:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82555349] [2024-05-08 07:27:25,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 07:27:25,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-08 07:27:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:27:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-08 07:27:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-05-08 07:27:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:25,890 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:27:25,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.066666666666666) internal successors, (121), 15 states have internal predecessors, (121), 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-08 07:27:25,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:25,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-05-08 07:27:25,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash -53736182, now seen corresponding path program 7 times [2024-05-08 07:27:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash -100855742, now seen corresponding path program 8 times [2024-05-08 07:27:26,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1270301566, now seen corresponding path program 9 times [2024-05-08 07:27:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2014318368, now seen corresponding path program 10 times [2024-05-08 07:27:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:26,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-05-08 07:27:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 07:27:27,054 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-08 07:27:27,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-08 07:27:27,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 07:27:27,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:27:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1792931401, now seen corresponding path program 3 times [2024-05-08 07:27:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:27:27,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375375126] [2024-05-08 07:27:27,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-08 07:27:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:27:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375375126] [2024-05-08 07:27:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375375126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 07:27:27,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 07:27:27,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-08 07:27:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88732398] [2024-05-08 07:27:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 07:27:27,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-08 07:27:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:27:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -53736182, now seen corresponding path program 11 times [2024-05-08 07:27:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:27,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 07:27:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-08 07:27:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:27,679 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:27:27,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-08 07:27:27,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:27,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-05-08 07:27:27,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 07:27:27,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:27:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -53736182, now seen corresponding path program 12 times [2024-05-08 07:27:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:27,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2014318368, now seen corresponding path program 13 times [2024-05-08 07:27:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:28,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 993809499, now seen corresponding path program 14 times [2024-05-08 07:27:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:28,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:27:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:27:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:27:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-08 07:27:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 07:27:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:27:28,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2024-05-08 07:27:28,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 07:27:28,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:27:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1620124764, now seen corresponding path program 4 times [2024-05-08 07:27:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:27:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834469689] [2024-05-08 07:27:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:27:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:27:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:27:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:27:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:27:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834469689] [2024-05-08 07:27:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834469689] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 07:27:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3495384] [2024-05-08 07:27:33,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-08 07:27:33,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 07:27:33,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:27:33,675 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-08 07:27:33,679 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-08 07:27:33,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-08 07:27:33,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 07:27:33,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 58 conjunts are in the unsatisfiable core [2024-05-08 07:27:33,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 07:27:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:27:40,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 07:28:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:28:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3495384] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 07:28:13,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 07:28:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 34] total 91 [2024-05-08 07:28:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302109004] [2024-05-08 07:28:13,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 07:28:13,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2024-05-08 07:28:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:28:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2024-05-08 07:28:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1218, Invalid=6970, Unknown=2, NotChecked=0, Total=8190 [2024-05-08 07:28:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:28:13,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:28:13,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 2.6043956043956045) internal successors, (237), 91 states have internal predecessors, (237), 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-08 07:28:13,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 07:28:13,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-08 07:28:13,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 07:28:13,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:28:13,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:28:41,660 WARN L293 SmtUtils]: Spent 27.62s on a formula simplification. DAG size of input: 171 DAG size of output: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:28:43,689 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-08 07:28:46,438 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-08 07:29:33,186 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 171 DAG size of output: 110 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:30:25,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 07:30:37,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 07:31:25,607 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-08 07:31:27,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 07:31:29,238 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (+ c_~S~0 c_~T~0))) (let ((.cse6 (* (div .cse23 4294967296) 4294967296))) (let ((.cse20 (* (div (+ c_~s~0 (- 1)) 4294967296) 4294967296)) (.cse16 (* (div c_~t~0 4294967296) 4294967296)) (.cse5 (+ c_~m~0 3)) (.cse4 (= .cse23 .cse6)) (.cse22 (+ c_~m~0 2)) (.cse21 (+ c_~S~0 c_~T~0 (* (div (+ c_~m~0 1) 4294967296) 4294967296))) (.cse7 (* (- 1) c_~S~0)) (.cse8 (* (- 1) c_~T~0))) (let ((.cse1 (and (or .cse4 (not (= (mod .cse22 4294967296) 0))) (<= .cse21 (+ c_~m~0 2 .cse6)) (<= (+ (* (div (+ c_~m~0 .cse7 .cse8 1) 4294967296) 4294967296) 4294967294 .cse6) c_~m~0))) (.cse9 (< (+ (* 4294967296 (div (+ c_~s~0 (- 4294967295)) 4294967296)) 4294967295) c_~s~0)) (.cse3 (< 0 (mod (+ 4294967292 c_~t~0) 4294967296))) (.cse10 (< 0 (mod (+ c_~t~0 4294967291) 4294967296))) (.cse2 (< (+ (* (div (+ c_~s~0 (- 4294967294)) 4294967296) 4294967296) 4294967294) c_~s~0)) (.cse14 (and (<= (+ .cse6 (* (div (+ c_~m~0 2 .cse7 .cse8) 4294967296) 4294967296) 4294967293) c_~m~0) (or (not (= (mod .cse5 4294967296) 0)) .cse4) (<= (+ c_~S~0 c_~T~0 (* (div .cse22 4294967296) 4294967296)) (+ c_~m~0 3 .cse6)))) (.cse12 (< 0 (mod c_~s~0 4294967296))) (.cse11 (= .cse21 (+ c_~m~0 .cse6 1))) (.cse0 (= (+ c_~m~0 .cse6) (+ c_~S~0 c_~T~0 (* (div c_~m~0 4294967296) 4294967296)))) (.cse13 (< 0 (mod (+ c_~t~0 4294967295) 4294967296))) (.cse19 (<= (+ .cse16 1) c_~t~0)) (.cse18 (+ c_~S~0 .cse20 c_~T~0 1)) (.cse15 (< c_~s~0 (+ .cse20 2)))) (and .cse0 (or .cse1 .cse2 .cse3) (or (and (or (not (= (mod (+ c_~m~0 4) 4294967296) 0)) .cse4) (<= (+ (* (div .cse5 4294967296) 4294967296) c_~S~0 c_~T~0) (+ c_~m~0 .cse6 4)) (<= (+ 4294967292 (* 4294967296 (div (+ c_~m~0 3 .cse7 .cse8) 4294967296)) .cse6) c_~m~0)) .cse9 .cse10) (or (and (or (< 0 (mod (+ c_~s~0 4294967295) 4294967296)) .cse11) (or .cse0 .cse12)) .cse13) (or .cse9 .cse1 (< 0 (mod (+ c_~t~0 4294967293) 4294967296))) (or .cse9 .cse3 .cse14) (or (= (mod c_thread2Thread1of1ForFork0_~cond~1 256) 0) .cse10 .cse2 .cse14) (or (and (or .cse12 .cse11) (or .cse0 (< 0 (mod (+ c_~s~0 1) 4294967296)))) .cse13) (or .cse15 (< c_~s~0 (+ 3 (* (div (+ c_~s~0 (- 2)) 4294967296) 4294967296))) (let ((.cse17 (* (div (+ c_~S~0 c_~T~0 (* (- 1) c_~t~0) (* (- 1) c_~m~0)) 4294967296) 4294967296))) (and (<= c_~t~0 (+ 4294967292 (* (div (+ c_~t~0 c_~m~0 4294967294 .cse7 .cse8) 4294967296) 4294967296) .cse16 .cse17)) (<= (+ c_~s~0 c_~t~0 c_~m~0 .cse17) .cse18) .cse19))) (or (and (<= c_~t~0 (+ (* (div (+ c_~s~0 (- 1) c_~t~0 c_~m~0 .cse7 .cse8) 4294967296) 4294967296) .cse16 4294967293)) .cse19 (<= (+ c_~s~0 c_~t~0 c_~m~0 (* (div c_~s~0 4294967296) 4294967296)) .cse18)) .cse15)))))) is different from false [2024-05-08 07:32:25,955 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 187 DAG size of output: 118 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:33:20,562 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 185 DAG size of output: 116 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:33:24,464 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-08 07:33:26,603 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-08 07:33:49,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 07:34:11,188 WARN L293 SmtUtils]: Spent 17.72s on a formula simplification. DAG size of input: 165 DAG size of output: 118 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:34:13,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 07:35:03,192 WARN L293 SmtUtils]: Spent 38.56s on a formula simplification. DAG size of input: 172 DAG size of output: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:35:17,288 WARN L293 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 153 DAG size of output: 118 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:35:30,841 WARN L293 SmtUtils]: Spent 9.72s on a formula simplification. DAG size of input: 151 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:35:35,983 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-08 07:36:12,671 WARN L293 SmtUtils]: Spent 15.61s on a formula simplification. DAG size of input: 186 DAG size of output: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:37:28,385 WARN L293 SmtUtils]: Spent 13.56s on a formula simplification. DAG size of input: 167 DAG size of output: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:37:50,046 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 158 DAG size of output: 128 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:40:00,951 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 146 DAG size of output: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 07:41:12,033 WARN L293 SmtUtils]: Spent 7.85s on a formula simplification. DAG size of input: 166 DAG size of output: 139 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-08 07:41:44,220 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-08 07:41:44,220 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-08 07:41:44,220 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 07:41:45,232 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-08 07:41:45,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-08 07:41:45,421 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-08 07:41:45,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-08 07:41:45,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-08 07:41:45,430 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-08 07:41:45,431 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-08 07:41:45,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-08 07:41:45,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-08 07:41:45,435 INFO L448 BasicCegarLoop]: Path program histogram: [14, 4, 3, 3, 1, 1] [2024-05-08 07:41:45,437 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 07:41:45,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 07:41:45,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 07:41:45 BasicIcfg [2024-05-08 07:41:45,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 07:41:45,439 INFO L158 Benchmark]: Toolchain (without parser) took 873091.47ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 99.4MB in the beginning and 550.4MB in the end (delta: -451.0MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2024-05-08 07:41:45,439 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 07:41:45,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.66ms. Allocated memory is still 163.6MB. Free memory was 99.2MB in the beginning and 87.8MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-08 07:41:45,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.20ms. Allocated memory is still 163.6MB. Free memory was 87.8MB in the beginning and 139.0MB in the end (delta: -51.2MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2024-05-08 07:41:45,440 INFO L158 Benchmark]: Boogie Preprocessor took 30.77ms. Allocated memory is still 163.6MB. Free memory was 139.0MB in the beginning and 137.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-08 07:41:45,440 INFO L158 Benchmark]: RCFGBuilder took 428.97ms. Allocated memory is still 163.6MB. Free memory was 137.8MB in the beginning and 121.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-05-08 07:41:45,440 INFO L158 Benchmark]: TraceAbstraction took 872339.04ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 120.5MB in the beginning and 550.4MB in the end (delta: -429.8MB). Peak memory consumption was 35.2MB. Max. memory is 8.0GB. [2024-05-08 07:41:45,441 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 163.6MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.66ms. Allocated memory is still 163.6MB. Free memory was 99.2MB in the beginning and 87.8MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.20ms. Allocated memory is still 163.6MB. Free memory was 87.8MB in the beginning and 139.0MB in the end (delta: -51.2MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.77ms. Allocated memory is still 163.6MB. Free memory was 139.0MB in the beginning and 137.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 428.97ms. Allocated memory is still 163.6MB. Free memory was 137.8MB in the beginning and 121.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 872339.04ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 120.5MB in the beginning and 550.4MB in the end (delta: -429.8MB). Peak memory consumption was 35.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2542, independent: 2185, independent conditional: 1886, independent unconditional: 299, dependent: 357, dependent conditional: 351, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2241, independent: 2185, independent conditional: 1886, independent unconditional: 299, dependent: 56, dependent conditional: 50, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2241, independent: 2185, independent conditional: 1886, independent unconditional: 299, dependent: 56, dependent conditional: 50, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2241, independent: 2185, independent conditional: 1886, independent unconditional: 299, dependent: 56, dependent conditional: 50, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2351, independent: 2185, independent conditional: 900, independent unconditional: 1285, dependent: 166, dependent conditional: 99, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2351, independent: 2185, independent conditional: 786, independent unconditional: 1399, dependent: 166, dependent conditional: 78, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2351, independent: 2185, independent conditional: 786, independent unconditional: 1399, dependent: 166, dependent conditional: 78, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 194, independent: 177, independent conditional: 18, independent unconditional: 159, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 194, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 127, dependent conditional: 79, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2351, independent: 2008, independent conditional: 768, independent unconditional: 1240, dependent: 149, dependent conditional: 67, dependent unconditional: 82, unknown: 194, unknown conditional: 29, unknown unconditional: 165] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 177, Positive conditional cache size: 18, Positive unconditional cache size: 159, Negative cache size: 17, Negative conditional cache size: 11, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 135, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2351, independent: 2185, independent conditional: 900, independent unconditional: 1285, dependent: 166, dependent conditional: 99, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2351, independent: 2185, independent conditional: 786, independent unconditional: 1399, dependent: 166, dependent conditional: 78, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2351, independent: 2185, independent conditional: 786, independent unconditional: 1399, dependent: 166, dependent conditional: 78, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 194, independent: 177, independent conditional: 18, independent unconditional: 159, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 194, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 127, dependent conditional: 79, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2351, independent: 2008, independent conditional: 768, independent unconditional: 1240, dependent: 149, dependent conditional: 67, dependent unconditional: 82, unknown: 194, unknown conditional: 29, unknown unconditional: 165] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 177, Positive conditional cache size: 18, Positive unconditional cache size: 159, Negative cache size: 17, Negative conditional cache size: 11, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 135 ], Independence queries for same thread: 301 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 98 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 872.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 14, EmptinessCheckTime: 822.1s, 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: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 48.7s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 16443 SizeOfPredicates, 41 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 298/561 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: 5.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 21, ConditionalCommutativityTraceChecks: 21, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown