/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 16:24:27,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 16:24:28,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 16:24:28,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 16:24:28,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 16:24:28,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 16:24:28,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 16:24:28,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 16:24:28,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 16:24:28,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 16:24:28,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 16:24:28,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 16:24:28,068 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 16:24:28,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 16:24:28,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 16:24:28,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 16:24:28,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 16:24:28,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 16:24:28,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 16:24:28,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 16:24:28,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 16:24:28,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 16:24:28,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 16:24:28,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 16:24:28,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 16:24:28,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 16:24:28,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 16:24:28,072 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 16:24:28,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 16:24:28,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 16:24:28,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 16:24:28,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 16:24:28,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 16:24:28,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 16:24:28,074 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 16:24:28,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 16:24:28,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 16:24:28,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 16:24:28,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 16:24:28,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-05-05 16:24:28,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 16:24:28,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 16:24:28,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 16:24:28,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 16:24:28,323 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 16:24:28,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2024-05-05 16:24:29,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 16:24:29,654 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 16:24:29,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2024-05-05 16:24:29,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c1b27dcce/bef8ece203494d76929a6aac4bea33ea/FLAGa5dc9c6cf [2024-05-05 16:24:29,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c1b27dcce/bef8ece203494d76929a6aac4bea33ea [2024-05-05 16:24:29,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 16:24:29,691 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 16:24:29,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 16:24:29,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 16:24:29,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 16:24:29,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 04:24:29" (1/1) ... [2024-05-05 16:24:29,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68847eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:29, skipping insertion in model container [2024-05-05 16:24:29,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 04:24:29" (1/1) ... [2024-05-05 16:24:29,748 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 16:24:29,878 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2024-05-05 16:24:30,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 16:24:30,047 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 16:24:30,058 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2024-05-05 16:24:30,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 16:24:30,123 INFO L206 MainTranslator]: Completed translation [2024-05-05 16:24:30,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30 WrapperNode [2024-05-05 16:24:30,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 16:24:30,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 16:24:30,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 16:24:30,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 16:24:30,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,156 INFO L138 Inliner]: procedures = 166, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2024-05-05 16:24:30,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 16:24:30,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 16:24:30,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 16:24:30,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 16:24:30,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 16:24:30,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 16:24:30,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 16:24:30,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 16:24:30,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (1/1) ... [2024-05-05 16:24:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 16:24:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 16:24:30,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-05 16:24:30,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-05 16:24:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 16:24:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-05-05 16:24:30,412 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-05 16:24:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 16:24:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 16:24:30,414 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 16:24:30,505 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 16:24:30,507 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 16:24:30,665 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 16:24:30,684 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 16:24:30,684 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-05 16:24:30,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 04:24:30 BoogieIcfgContainer [2024-05-05 16:24:30,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 16:24:30,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 16:24:30,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 16:24:30,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 16:24:30,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 04:24:29" (1/3) ... [2024-05-05 16:24:30,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314345cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 04:24:30, skipping insertion in model container [2024-05-05 16:24:30,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 04:24:30" (2/3) ... [2024-05-05 16:24:30,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314345cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 04:24:30, skipping insertion in model container [2024-05-05 16:24:30,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 04:24:30" (3/3) ... [2024-05-05 16:24:30,692 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2024-05-05 16:24:30,698 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 16:24:30,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 16:24:30,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-05 16:24:30,706 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 16:24:30,764 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-05 16:24:30,802 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 16:24:30,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 16:24:30,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 16:24:30,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-05 16:24:30,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-05 16:24:30,854 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 16:24:30,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:30,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 16:24:30,880 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;@27eb089d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-05 16:24:30,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-05 16:24:30,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:30,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1855514069, now seen corresponding path program 1 times [2024-05-05 16:24:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499421511] [2024-05-05 16:24:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:31,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:31,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499421511] [2024-05-05 16:24:31,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499421511] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 16:24:31,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 16:24:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 16:24:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353601572] [2024-05-05 16:24:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:24:31,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 16:24:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:31,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-05 16:24:31,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-05 16:24:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:31,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:31,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:31,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:31,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 16:24:31,848 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:31,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash 162488770, now seen corresponding path program 1 times [2024-05-05 16:24:31,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:31,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462780093] [2024-05-05 16:24:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462780093] [2024-05-05 16:24:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462780093] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 16:24:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703851652] [2024-05-05 16:24:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:32,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 16:24:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 16:24:32,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-05 16:24:32,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-05 16:24:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:32,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-05 16:24:32,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 16:24:33,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-05 16:24:33,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-05 16:24:33,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-05 16:24:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:33,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 16:24:34,468 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-05 16:24:34,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-05-05 16:24:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703851652] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 16:24:34,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 16:24:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 43 [2024-05-05 16:24:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219009662] [2024-05-05 16:24:34,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 16:24:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-05-05 16:24:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:34,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-05-05 16:24:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1257485245, now seen corresponding path program 1 times [2024-05-05 16:24:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:35,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-05-05 16:24:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2189, Unknown=0, NotChecked=0, Total=2450 [2024-05-05 16:24:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:35,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:35,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 7.24) internal successors, (362), 50 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:35,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:35,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-05 16:24:38,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-05 16:24:38,526 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,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-05 16:24:38,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:38,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1204183336, now seen corresponding path program 2 times [2024-05-05 16:24:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834779299] [2024-05-05 16:24:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-05-05 16:24:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834779299] [2024-05-05 16:24:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834779299] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 16:24:38,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 16:24:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-05 16:24:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830258768] [2024-05-05 16:24:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:24:38,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-05 16:24:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-05 16:24:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-05 16:24:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:38,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:38,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-05-05 16:24:38,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-05 16:24:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:39,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-05 16:24:39,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:39,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash -378219424, now seen corresponding path program 3 times [2024-05-05 16:24:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968466624] [2024-05-05 16:24:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-05 16:24:40,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968466624] [2024-05-05 16:24:40,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968466624] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 16:24:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898671050] [2024-05-05 16:24:40,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 16:24:40,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 16:24:40,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 16:24:40,760 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-05 16:24:40,762 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-05 16:24:40,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-05-05 16:24:40,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 16:24:40,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-05 16:24:40,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 16:24:41,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-05 16:24:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-05 16:24:41,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 16:24:42,217 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-05 16:24:42,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 53 [2024-05-05 16:24:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-05 16:24:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898671050] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 16:24:42,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 16:24:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 16] total 58 [2024-05-05 16:24:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469819733] [2024-05-05 16:24:42,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 16:24:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-05-05 16:24:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-05-05 16:24:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3022, Unknown=0, NotChecked=0, Total=3306 [2024-05-05 16:24:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:42,279 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:42,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.310344827586207) internal successors, (424), 58 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:42,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:42,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-05-05 16:24:42,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:42,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-05 16:24:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-05-05 16:24:45,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-05 16:24:45,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 16:24:45,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:45,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 99841514, now seen corresponding path program 1 times [2024-05-05 16:24:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477704517] [2024-05-05 16:24:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-05-05 16:24:46,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477704517] [2024-05-05 16:24:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477704517] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 16:24:46,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 16:24:46,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-05 16:24:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663900176] [2024-05-05 16:24:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:24:46,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-05 16:24:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-05 16:24:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-05-05 16:24:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:46,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:46,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:46,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:46,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-05 16:24:46,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:46,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-05-05 16:24:46,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-05-05 16:24:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-05-05 16:24:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:24:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-05 16:24:55,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:55,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash 377202028, now seen corresponding path program 2 times [2024-05-05 16:24:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:55,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887858121] [2024-05-05 16:24:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 381 proven. 11 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2024-05-05 16:24:56,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887858121] [2024-05-05 16:24:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887858121] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 16:24:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506709418] [2024-05-05 16:24:56,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 16:24:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 16:24:56,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 16:24:56,898 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-05 16:24:56,913 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-05 16:24:57,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 16:24:57,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 16:24:57,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 34 conjunts are in the unsatisfiable core [2024-05-05 16:24:57,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 16:24:57,200 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-05 16:24:57,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-05 16:24:57,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-05 16:24:57,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 16:24:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2024-05-05 16:24:57,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-05 16:24:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506709418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 16:24:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-05 16:24:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2024-05-05 16:24:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830654065] [2024-05-05 16:24:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:24:57,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-05 16:24:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:57,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-05 16:24:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2024-05-05 16:24:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:57,565 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:57,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:57,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:57,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-05-05 16:24:57,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 192 states. [2024-05-05 16:24:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:24:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-05-05 16:24:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2024-05-05 16:24:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:24:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-05 16:24:57,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-05 16:24:58,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 16:24:58,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:58,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1461675254, now seen corresponding path program 1 times [2024-05-05 16:24:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:58,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898632764] [2024-05-05 16:24:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:58,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898632764] [2024-05-05 16:24:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898632764] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 16:24:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 16:24:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-05-05 16:24:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368449716] [2024-05-05 16:24:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:24:58,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-05 16:24:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-05 16:24:58,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-05-05 16:24:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:58,224 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:58,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:58,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-05-05 16:24:58,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 193 states. [2024-05-05 16:24:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:24:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-05 16:24:58,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2024-05-05 16:24:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-05-05 16:24:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:24:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 16:24:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 16:24:59,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-05 16:24:59,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:24:59,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:24:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash 483145494, now seen corresponding path program 1 times [2024-05-05 16:24:59,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:24:59,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317044243] [2024-05-05 16:24:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:24:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:24:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:24:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:24:59,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:24:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317044243] [2024-05-05 16:24:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317044243] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 16:24:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 16:24:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-05-05 16:24:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974099130] [2024-05-05 16:24:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:24:59,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-05 16:24:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:24:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-05 16:24:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-05-05 16:24:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:24:59,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:24:59,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:24:59,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 203 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 16:24:59,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-05 16:25:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 16:25:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-05 16:25:00,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-05 16:25:00,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-05 16:25:00,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 16:25:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1786701729, now seen corresponding path program 2 times [2024-05-05 16:25:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 16:25:00,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344329789] [2024-05-05 16:25:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:25:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:25:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 16:25:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:25:01,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 16:25:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344329789] [2024-05-05 16:25:01,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344329789] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 16:25:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741457428] [2024-05-05 16:25:01,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 16:25:01,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 16:25:01,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 16:25:01,693 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-05 16:25:01,736 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-05 16:25:01,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 16:25:01,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 16:25:01,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-05 16:25:01,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 16:25:01,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-05 16:25:01,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-05 16:25:01,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-05 16:25:02,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-05 16:25:02,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-05 16:25:02,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-05 16:25:02,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-05 16:25:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:25:02,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 16:25:12,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 16:25:12,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-05-05 16:25:12,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-05 16:25:12,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2024-05-05 16:25:12,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-05-05 16:25:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 16:25:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741457428] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-05 16:25:12,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-05 16:25:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [28, 22] total 64 [2024-05-05 16:25:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976774790] [2024-05-05 16:25:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 16:25:12,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-05 16:25:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 16:25:16,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 288 [2024-05-05 16:25:22,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1226 treesize of output 1130 [2024-05-05 16:25:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1342729638, now seen corresponding path program 1 times [2024-05-05 16:25:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 16:25:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 16:25:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-05-05 16:25:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-05 16:25:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=3757, Unknown=6, NotChecked=0, Total=4160 [2024-05-05 16:25:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:25:28,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 16:25:28,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.954545454545454) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 203 states. [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-05 16:25:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 16:25:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-05 16:25:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 16:25:33,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:25:54,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:25:55,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:25:57,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:26:00,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:26:02,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:26:05,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:26:08,513 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse7 (+ 1 (select .cse6 |c_~#pqb~0.offset|)))) (and (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int) (|v_ULTIMATE.start_pqueue_put_#t~post4#1_29| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_pqueue_put_~qp#1.base| (store .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_29| 1))))) (let ((.cse0 (select .cse2 |c_~#pqb~0.base|))) (or (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| (select .cse0 |c_~#pqb~0.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_29| (select .cse1 |c_ULTIMATE.start_pqueue_put_~qp#1.offset|)) (< 0 (select (select (store .cse2 |c_~#pqb~0.base| (store .cse0 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))))))) (not (= (select |c_#valid| 3) 0)) (not (= (select |c_#valid| |c_~#pqb~0.base|) 0)) (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int) (|v_ULTIMATE.start_pqueue_put_#t~post4#1_29| Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| (store .cse4 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_29| 1))))) (let ((.cse3 (select .cse5 |c_~#pqb~0.base|))) (or (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| (select .cse3 |c_~#pqb~0.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_29| (select .cse4 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (< 0 (select (select (store .cse5 |c_~#pqb~0.base| (store .cse3 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))))))) (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int)) (or (< 0 (select (select (store |c_#memory_int| |c_~#pqb~0.base| (store .cse6 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| .cse7))) (forall ((v_ArrVal_535 (Array Int Int))) (< 0 (+ 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_535) |c_~#pqb~0.base|) |c_~#pqb~0.offset|)))) (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int)) (or (< 0 (select (select (store |c_#memory_int| |c_~#pqb~0.base| (store .cse6 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| .cse7)))))) is different from false [2024-05-05 16:26:10,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:34,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#pqb~0.base|))) (let ((.cse4 (+ 1 (select .cse3 |c_~#pqb~0.offset|)))) (and (<= 1 |c_workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (not (= (select |c_#valid| 3) 0)) (not (= (select |c_#valid| |c_~#pqb~0.base|) 0)) (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int) (|v_ULTIMATE.start_pqueue_put_#t~post4#1_29| Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_pqueue_put_#in~qp#1.base| (store .cse1 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_29| 1))))) (let ((.cse0 (select .cse2 |c_~#pqb~0.base|))) (or (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| (select .cse0 |c_~#pqb~0.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_29| (select .cse1 |c_ULTIMATE.start_pqueue_put_#in~qp#1.offset|)) (< 0 (select (select (store .cse2 |c_~#pqb~0.base| (store .cse0 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))))))) (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int)) (or (< 0 (select (select (store |c_#memory_int| |c_~#pqb~0.base| (store .cse3 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| .cse4))) (forall ((v_ArrVal_535 (Array Int Int))) (< 0 (+ 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#tid~0#1.base| v_ArrVal_535) |c_~#pqb~0.base|) |c_~#pqb~0.offset|)))) (forall ((|v_ULTIMATE.start_pqueue_put_#t~post4#1_25| Int)) (or (< 0 (select (select (store |c_#memory_int| |c_~#pqb~0.base| (store .cse3 |c_~#pqb~0.offset| (+ |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| 1))) |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |c_workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|)) (< |v_ULTIMATE.start_pqueue_put_#t~post4#1_25| .cse4)))))) is different from false [2024-05-05 16:27:36,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:39,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:40,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:46,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:49,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:52,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:55,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:27:57,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:28:00,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:28:02,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:28:08,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:28:14,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-05 16:28:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-05 16:28:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2024-05-05 16:28:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-05 16:28:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-05-05 16:28:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-05 16:28:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-05 16:28:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-05 16:28:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-05 16:28:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-05 16:28:23,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-05-05 16:28:23,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-05 16:28:23,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-05-05 16:28:23,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-05-05 16:28:23,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-05 16:28:23,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-05 16:28:23,335 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-05-05 16:28:23,339 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2024-05-05 16:28:23,343 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 16:28:23,343 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 16:28:23,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 04:28:23 BasicIcfg [2024-05-05 16:28:23,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 16:28:23,346 INFO L158 Benchmark]: Toolchain (without parser) took 233655.21ms. Allocated memory was 199.2MB in the beginning and 785.4MB in the end (delta: 586.2MB). Free memory was 125.9MB in the beginning and 356.9MB in the end (delta: -231.0MB). Peak memory consumption was 356.0MB. Max. memory is 8.0GB. [2024-05-05 16:28:23,346 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 16:28:23,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.54ms. Allocated memory is still 199.2MB. Free memory was 125.6MB in the beginning and 105.4MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-05 16:28:23,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.86ms. Allocated memory is still 199.2MB. Free memory was 105.4MB in the beginning and 103.0MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-05 16:28:23,346 INFO L158 Benchmark]: Boogie Preprocessor took 98.24ms. Allocated memory is still 199.2MB. Free memory was 103.0MB in the beginning and 165.9MB in the end (delta: -62.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2024-05-05 16:28:23,346 INFO L158 Benchmark]: RCFGBuilder took 430.46ms. Allocated memory is still 199.2MB. Free memory was 165.9MB in the beginning and 147.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-05-05 16:28:23,347 INFO L158 Benchmark]: TraceAbstraction took 232657.81ms. Allocated memory was 199.2MB in the beginning and 785.4MB in the end (delta: 586.2MB). Free memory was 146.0MB in the beginning and 356.9MB in the end (delta: -211.0MB). Peak memory consumption was 376.2MB. Max. memory is 8.0GB. [2024-05-05 16:28:23,347 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.10ms. Allocated memory is still 199.2MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.54ms. Allocated memory is still 199.2MB. Free memory was 125.6MB in the beginning and 105.4MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.86ms. Allocated memory is still 199.2MB. Free memory was 105.4MB in the beginning and 103.0MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 98.24ms. Allocated memory is still 199.2MB. Free memory was 103.0MB in the beginning and 165.9MB in the end (delta: -62.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 430.46ms. Allocated memory is still 199.2MB. Free memory was 165.9MB in the beginning and 147.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 232657.81ms. Allocated memory was 199.2MB in the beginning and 785.4MB in the end (delta: 586.2MB). Free memory was 146.0MB in the beginning and 356.9MB in the end (delta: -211.0MB). Peak memory consumption was 376.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: 48265, independent: 45398, independent conditional: 45174, independent unconditional: 224, dependent: 2867, dependent conditional: 2866, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45489, independent: 45398, independent conditional: 45174, independent unconditional: 224, dependent: 91, dependent conditional: 90, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45489, independent: 45398, independent conditional: 45174, independent unconditional: 224, dependent: 91, dependent conditional: 90, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45489, independent: 45398, independent conditional: 45174, independent unconditional: 224, dependent: 91, dependent conditional: 90, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46053, independent: 45398, independent conditional: 1190, independent unconditional: 44208, dependent: 655, dependent conditional: 490, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46053, independent: 45398, independent conditional: 961, independent unconditional: 44437, dependent: 655, dependent conditional: 355, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46053, independent: 45398, independent conditional: 961, independent unconditional: 44437, dependent: 655, dependent conditional: 355, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2889, independent: 2824, independent conditional: 97, independent unconditional: 2727, dependent: 65, dependent conditional: 58, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2889, independent: 2820, independent conditional: 0, independent unconditional: 2820, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 65, dependent conditional: 58, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 65, dependent conditional: 58, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 181, dependent conditional: 132, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 46053, independent: 42574, independent conditional: 864, independent unconditional: 41710, dependent: 590, dependent conditional: 297, dependent unconditional: 293, unknown: 2889, unknown conditional: 155, unknown unconditional: 2734] , Statistics on independence cache: Total cache size (in pairs): 2889, Positive cache size: 2824, Positive conditional cache size: 97, Positive unconditional cache size: 2727, Negative cache size: 65, Negative conditional cache size: 58, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 364, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46053, independent: 45398, independent conditional: 1190, independent unconditional: 44208, dependent: 655, dependent conditional: 490, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46053, independent: 45398, independent conditional: 961, independent unconditional: 44437, dependent: 655, dependent conditional: 355, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46053, independent: 45398, independent conditional: 961, independent unconditional: 44437, dependent: 655, dependent conditional: 355, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2889, independent: 2824, independent conditional: 97, independent unconditional: 2727, dependent: 65, dependent conditional: 58, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2889, independent: 2820, independent conditional: 0, independent unconditional: 2820, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 65, dependent conditional: 58, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 65, dependent conditional: 58, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 181, dependent conditional: 132, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 46053, independent: 42574, independent conditional: 864, independent unconditional: 41710, dependent: 590, dependent conditional: 297, dependent unconditional: 293, unknown: 2889, unknown conditional: 155, unknown unconditional: 2734] , Statistics on independence cache: Total cache size (in pairs): 2889, Positive cache size: 2824, Positive conditional cache size: 97, Positive unconditional cache size: 2727, Negative cache size: 65, Negative conditional cache size: 58, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 364 ], Independence queries for same thread: 2776 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 192 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 232.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 193.8s, 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: 516, 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.4s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 2568 NumberOfCodeBlocks, 2481 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2985 ConstructedInterpolants, 92 QuantifiedInterpolants, 17708 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1852 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 3870/4098 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: 16.9s, ConditionalCommutativityIAIntegrations: 1, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 5, ConditionalCommutativityTraceChecks: 2, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-05 16:28:23,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-05 16:28:23,768 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-05 16:28:23,817 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 Received shutdown request...