/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 08:41:19,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 08:41:19,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 08:41:19,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 08:41:19,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 08:41:19,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 08:41:19,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 08:41:19,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 08:41:19,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 08:41:19,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 08:41:19,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 08:41:19,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 08:41:19,083 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 08:41:19,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 08:41:19,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 08:41:19,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 08:41:19,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 08:41:19,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 08:41:19,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 08:41:19,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 08:41:19,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 08:41:19,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 08:41:19,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 08:41:19,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 08:41:19,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 08:41:19,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 08:41:19,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 08:41:19,088 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 08:41:19,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 08:41:19,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 08:41:19,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 08:41:19,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 08:41:19,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 08:41:19,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 08:41:19,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 08:41:19,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 08:41:19,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 08:41:19,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 08:41:19,346 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 08:41:19,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-05-06 08:41:20,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 08:41:20,667 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 08:41:20,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2024-05-06 08:41:20,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/63184f581/496a7e36704c402f86d06a7a2d089ba2/FLAG1f48bd037 [2024-05-06 08:41:20,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/63184f581/496a7e36704c402f86d06a7a2d089ba2 [2024-05-06 08:41:20,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 08:41:20,696 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 08:41:20,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 08:41:20,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 08:41:20,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 08:41:20,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:41:20" (1/1) ... [2024-05-06 08:41:20,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5065b92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:20, skipping insertion in model container [2024-05-06 08:41:20,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:41:20" (1/1) ... [2024-05-06 08:41:20,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 08:41:21,119 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-05-06 08:41:21,129 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-05-06 08:41:21,136 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-05-06 08:41:21,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 08:41:21,158 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 08:41:21,263 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-05-06 08:41:21,264 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-05-06 08:41:21,266 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-05-06 08:41:21,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 08:41:21,337 INFO L206 MainTranslator]: Completed translation [2024-05-06 08:41:21,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21 WrapperNode [2024-05-06 08:41:21,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 08:41:21,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 08:41:21,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 08:41:21,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 08:41:21,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,389 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-05-06 08:41:21,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 08:41:21,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 08:41:21,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 08:41:21,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 08:41:21,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 08:41:21,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 08:41:21,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 08:41:21,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 08:41:21,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (1/1) ... [2024-05-06 08:41:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 08:41:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:41:21,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 08:41:21,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 08:41:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-06 08:41:21,498 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-06 08:41:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-06 08:41:21,498 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-06 08:41:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 08:41:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 08:41:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-06 08:41:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 08:41:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 08:41:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-06 08:41:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 08:41:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 08:41:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 08:41:21,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 08:41:21,507 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 08:41:21,650 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 08:41:21,652 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 08:41:21,979 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 08:41:21,999 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 08:41:21,999 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-06 08:41:22,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:41:22 BoogieIcfgContainer [2024-05-06 08:41:22,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 08:41:22,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 08:41:22,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 08:41:22,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 08:41:22,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 08:41:20" (1/3) ... [2024-05-06 08:41:22,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c3b115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:41:22, skipping insertion in model container [2024-05-06 08:41:22,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:41:21" (2/3) ... [2024-05-06 08:41:22,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c3b115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:41:22, skipping insertion in model container [2024-05-06 08:41:22,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:41:22" (3/3) ... [2024-05-06 08:41:22,009 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-05-06 08:41:22,016 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 08:41:22,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 08:41:22,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-06 08:41:22,026 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 08:41:22,098 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 08:41:22,153 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 08:41:22,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 08:41:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:41:22,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 08:41:22,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 08:41:22,190 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 08:41:22,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:22,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 08:41:22,209 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;@676781ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 08:41:22,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 08:41:22,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:22,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 354382951, now seen corresponding path program 1 times [2024-05-06 08:41:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:22,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955002427] [2024-05-06 08:41:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:22,527 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-06 08:41:22,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:22,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955002427] [2024-05-06 08:41:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955002427] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:22,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 08:41:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604936155] [2024-05-06 08:41:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:22,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 08:41:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 08:41:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 08:41:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:22,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:22,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 08:41:22,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:22,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash 988144468, now seen corresponding path program 1 times [2024-05-06 08:41:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099245623] [2024-05-06 08:41:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:22,899 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-06 08:41:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:22,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099245623] [2024-05-06 08:41:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099245623] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 08:41:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740254904] [2024-05-06 08:41:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:22,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-06 08:41:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:22,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 08:41:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 08:41:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,905 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:22,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:22,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:22,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 08:41:22,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:22,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2145678791, now seen corresponding path program 1 times [2024-05-06 08:41:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933379550] [2024-05-06 08:41:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:24,228 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-06 08:41:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933379550] [2024-05-06 08:41:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933379550] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-05-06 08:41:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902566860] [2024-05-06 08:41:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:24,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-06 08:41:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:24,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-06 08:41:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-05-06 08:41:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:24,234 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 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-06 08:41:24,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:24,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:24,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:24,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-06 08:41:24,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:24,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1468984428, now seen corresponding path program 1 times [2024-05-06 08:41:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:24,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469992782] [2024-05-06 08:41:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:26,282 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-06 08:41:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469992782] [2024-05-06 08:41:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469992782] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:26,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-05-06 08:41:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673167780] [2024-05-06 08:41:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-06 08:41:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-06 08:41:26,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2024-05-06 08:41:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:26,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:26,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 27 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:26,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:26,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:26,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:26,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-06 08:41:27,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-06 08:41:27,232 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:27,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1786371939, now seen corresponding path program 1 times [2024-05-06 08:41:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202974149] [2024-05-06 08:41:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:27,297 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-06 08:41:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202974149] [2024-05-06 08:41:27,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202974149] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:27,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:27,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 08:41:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298693022] [2024-05-06 08:41:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:27,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-06 08:41:27,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 08:41:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 08:41:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:27,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:27,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:27,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:27,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:27,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:27,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-06 08:41:27,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-06 08:41:27,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:27,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1917543094, now seen corresponding path program 1 times [2024-05-06 08:41:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413845078] [2024-05-06 08:41:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:30,021 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-06 08:41:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413845078] [2024-05-06 08:41:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413845078] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-05-06 08:41:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099887293] [2024-05-06 08:41:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:30,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-06 08:41:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:30,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-06 08:41:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-05-06 08:41:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:30,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:30,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.6) internal successors, (198), 30 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:30,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:30,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:30,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:30,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:30,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:30,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-06 08:41:31,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-06 08:41:31,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:31,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash 145069809, now seen corresponding path program 1 times [2024-05-06 08:41:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246839706] [2024-05-06 08:41:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:34,447 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-06 08:41:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246839706] [2024-05-06 08:41:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246839706] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2024-05-06 08:41:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931256721] [2024-05-06 08:41:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:34,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-06 08:41:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-06 08:41:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2024-05-06 08:41:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:34,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:34,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.17948717948718) internal successors, (202), 39 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:34,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:34,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:34,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:34,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:34,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:34,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-06 08:41:34,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-06 08:41:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:41:36,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-06 08:41:36,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:36,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 272690006, now seen corresponding path program 1 times [2024-05-06 08:41:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:36,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234005787] [2024-05-06 08:41:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:41,748 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-06 08:41:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234005787] [2024-05-06 08:41:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234005787] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 08:41:41,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 08:41:41,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2024-05-06 08:41:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731477412] [2024-05-06 08:41:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 08:41:41,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-05-06 08:41:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:41:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-05-06 08:41:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2024-05-06 08:41:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:41,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:41:41,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.12) internal successors, (206), 50 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:41:41,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:41,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:41,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-06 08:41:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:41:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-06 08:41:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:41:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-06 08:41:45,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-06 08:41:45,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:41:45,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:41:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash -680365112, now seen corresponding path program 1 times [2024-05-06 08:41:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:41:45,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442746200] [2024-05-06 08:41:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:41:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:41:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:41:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442746200] [2024-05-06 08:41:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442746200] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 08:41:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061880582] [2024-05-06 08:41:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:41:49,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 08:41:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:41:49,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 08:41:49,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 08:41:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:41:49,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 104 conjunts are in the unsatisfiable core [2024-05-06 08:41:49,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 08:41:49,711 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-06 08:41:49,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-06 08:41:49,753 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-06 08:41:49,754 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-06 08:41:49,935 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-06 08:41:49,988 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 19 treesize of output 18 [2024-05-06 08:41:50,272 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 23 treesize of output 16 [2024-05-06 08:41:50,618 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-06 08:41:50,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2024-05-06 08:41:50,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-06 08:41:50,867 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-06 08:41:50,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:41:50,968 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-06 08:41:51,159 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-06 08:41:51,488 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-06 08:41:51,489 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 1 case distinctions, treesize of input 34 treesize of output 14 [2024-05-06 08:41:51,519 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 23 treesize of output 11 [2024-05-06 08:41:51,714 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-06 08:41:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:41:51,794 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-06 08:41:52,011 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 23 treesize of output 11 [2024-05-06 08:41:52,069 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 23 treesize of output 11 [2024-05-06 08:41:52,287 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-06 08:41:52,287 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 1 case distinctions, treesize of input 34 treesize of output 14 [2024-05-06 08:41:52,305 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 23 treesize of output 11 [2024-05-06 08:41:52,316 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-06 08:41:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:41:52,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 08:41:52,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2024-05-06 08:41:55,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= .cse0 800) (forall ((v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_406) .cse2 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (< (+ .cse0 1) v_ArrVal_408))))))) is different from false [2024-05-06 08:42:22,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_410 (Array Int Int)) (v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_31| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_26| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_31| 1))) |c_~#stored_elements~0.base| v_ArrVal_403) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404) |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_26|))) (let ((.cse3 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (< (+ .cse3 1) v_ArrVal_408) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_31|) (= 800 .cse3) (< (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404) |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) .cse1) 800))))))))) is different from false [2024-05-06 08:42:22,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_410 (Array Int Int)) (v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_31| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_26| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_399))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse4 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_31| 1))) |c_~#stored_elements~0.base| v_ArrVal_403) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404) |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_26|))) (let ((.cse6 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404) |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) .cse1) 800) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33|) (< (+ .cse6 1) v_ArrVal_408) (= .cse6 800) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_31|))))))))) is different from false [2024-05-06 08:42:22,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:42:22,848 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 2 case distinctions, treesize of input 432 treesize of output 287 [2024-05-06 08:42:22,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:42:22,870 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 998 treesize of output 994 [2024-05-06 08:42:22,908 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 236 treesize of output 228 [2024-05-06 08:42:22,924 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 616 treesize of output 568 [2024-05-06 08:42:22,945 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 596 treesize of output 572 [2024-05-06 08:42:23,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:42:23,021 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 16 treesize of output 8 [2024-05-06 08:42:23,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:42:23,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 280 [2024-05-06 08:42:23,819 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 3 [2024-05-06 08:42:24,558 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-05-06 08:42:24,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-05-06 08:42:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-05-06 08:42:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061880582] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 08:42:24,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 08:42:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35, 40] total 109 [2024-05-06 08:42:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038961912] [2024-05-06 08:42:24,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 08:42:24,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-05-06 08:42:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:42:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-05-06 08:42:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1089, Invalid=9652, Unknown=195, NotChecked=836, Total=11772 [2024-05-06 08:42:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:42:24,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:42:24,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 6.660550458715596) internal successors, (726), 109 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:42:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-06 08:42:24,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-06 08:42:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-06 08:42:45,966 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-06 08:42:46,166 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,SelfDestructingSolverStorable8 [2024-05-06 08:42:46,166 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:42:46,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:42:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1926876931, now seen corresponding path program 1 times [2024-05-06 08:42:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:42:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111604407] [2024-05-06 08:42:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:42:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:42:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:42:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:42:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 08:42:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111604407] [2024-05-06 08:42:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111604407] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 08:42:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710239478] [2024-05-06 08:42:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:42:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 08:42:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 08:42:51,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 08:42:51,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-06 08:42:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 08:42:51,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 125 conjunts are in the unsatisfiable core [2024-05-06 08:42:51,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 08:42:51,487 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-06 08:42:51,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-06 08:42:51,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-06 08:42:51,540 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-06 08:42:51,725 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-06 08:42:51,794 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 19 treesize of output 18 [2024-05-06 08:42:51,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-05-06 08:42:52,202 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 30 treesize of output 21 [2024-05-06 08:42:52,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:52,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:52,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-05-06 08:42:52,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-05-06 08:42:52,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-05-06 08:42:53,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:53,006 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 23 treesize of output 16 [2024-05-06 08:42:53,437 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 23 treesize of output 16 [2024-05-06 08:42:53,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:53,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:53,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-05-06 08:42:53,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-06 08:42:54,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-06 08:42:54,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:54,190 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 23 treesize of output 16 [2024-05-06 08:42:54,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-06 08:42:54,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-05-06 08:42:55,046 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-06 08:42:55,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2024-05-06 08:42:55,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-06 08:42:55,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-06 08:42:55,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 08:42:55,223 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-06 08:42:55,390 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 23 treesize of output 11 [2024-05-06 08:42:55,398 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-06 08:42:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 08:42:55,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 08:43:10,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_568 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_566) .cse4 v_ArrVal_568)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_568) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800)))))) is different from false [2024-05-06 08:43:10,674 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (v_ArrVal_568 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_566) .cse5 v_ArrVal_568)))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_568) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))))) is different from false [2024-05-06 08:43:10,704 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (v_ArrVal_568 Int)) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_566) .cse4 v_ArrVal_568)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_568) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse2 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse1) 800)))))) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))) is different from false [2024-05-06 08:43:10,756 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (v_ArrVal_568 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_566) .cse3 v_ArrVal_568)))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse5 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse6 .cse3) 1) v_ArrVal_568) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-05-06 08:43:41,043 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) (+ |c_t1Thread1of1ForFork1_empty_~q#1.offset| 3204)) |c_t1Thread1of1ForFork1_empty_#t~mem31#1|)) is different from false [2024-05-06 08:43:41,317 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_#in~q#1.base|))) (= (select .cse7 (+ |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| 3204)) (select .cse7 (+ |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| 3200))))) is different from false [2024-05-06 08:43:41,676 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse2 (select (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse4) (select .cse5 .cse1))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse8 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse4) 800))))))) is different from false [2024-05-06 08:43:41,905 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse8 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse5 (select (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse4 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse2) (select .cse7 .cse1)))))))))) is different from false [2024-05-06 08:43:41,935 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse4 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse5 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse6 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse6 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse8 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800)))))))) is different from false [2024-05-06 08:43:42,499 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse6 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse7 (select (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_566) .cse4 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse3 v_ArrVal_575) .cse4 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse2) (select .cse5 .cse4))) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (+ (select .cse8 .cse4) 1) v_ArrVal_568) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))))))) is different from false [2024-05-06 08:43:42,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse4 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse8 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse6 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse7 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-05-06 08:43:42,671 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse12 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ 1 (select .cse12 .cse1))))))) (let ((.cse8 (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse4 (select (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_566) .cse3 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse6 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_568) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse5 .cse6) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse3) (select .cse7 .cse6))) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse10 v_ArrVal_575) .cse3 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse6) 800))))))))))) is different from false [2024-05-06 08:43:42,757 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse12 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ 1 (select .cse12 .cse6))))))) (let ((.cse4 (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse10 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 .cse3))) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_568) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse9 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-05-06 08:43:51,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse11 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse0 (select (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse4) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse4) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse1) (select .cse8 .cse4))))))))))) is different from false [2024-05-06 08:43:52,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse11 .cse3 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse5 (select (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse0 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|))) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_566) .cse4 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse3 v_ArrVal_575) .cse4 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (+ (select .cse6 .cse4) 1) v_ArrVal_568) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse2) (select .cse8 .cse4))) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|))))))))) is different from false [2024-05-06 08:43:52,125 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204) 0) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse11 .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse9 (select (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 .cse3) (select .cse4 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse7 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-05-06 08:43:52,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:43:52,159 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 3 case distinctions, treesize of input 1105 treesize of output 615 [2024-05-06 08:43:52,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:43:52,182 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 1932 treesize of output 1904 [2024-05-06 08:43:52,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 594 [2024-05-06 08:43:52,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 714 [2024-05-06 08:43:52,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 520 [2024-05-06 08:43:52,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-05-06 08:43:52,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:43:52,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 12 [2024-05-06 08:43:54,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 08:43:54,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 887 treesize of output 855 [2024-05-06 08:43:55,487 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 3 [2024-05-06 08:43:56,256 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-05-06 08:43:56,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-05-06 08:43:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-05-06 08:43:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710239478] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 08:43:56,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 08:43:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 53] total 141 [2024-05-06 08:43:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937037742] [2024-05-06 08:43:56,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 08:43:56,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2024-05-06 08:43:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 08:43:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2024-05-06 08:43:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1512, Invalid=13847, Unknown=205, NotChecked=4176, Total=19740 [2024-05-06 08:43:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:43:56,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 08:43:56,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 141 states have (on average 5.75886524822695) internal successors, (812), 141 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-06 08:43:56,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:43:56,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-06 08:43:56,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-06 08:43:56,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-06 08:44:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-06 08:44:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-06 08:44:15,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-06 08:44:16,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-06 08:44:16,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 08:44:16,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 08:44:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1452722792, now seen corresponding path program 1 times [2024-05-06 08:44:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 08:44:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424549415] [2024-05-06 08:44:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 08:44:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 08:44:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2024-05-06 08:52:52,643 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 08:52:52,643 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 08:52:52,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-06 08:52:52,735 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-05-06 08:52:52,738 INFO L158 Benchmark]: Toolchain (without parser) took 692042.44ms. Allocated memory was 281.0MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 209.1MB in the beginning and 995.7MB in the end (delta: -786.6MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2024-05-06 08:52:52,738 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 158.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 08:52:52,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.43ms. Allocated memory is still 281.0MB. Free memory was 209.0MB in the beginning and 235.3MB in the end (delta: -26.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-05-06 08:52:52,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.27ms. Allocated memory is still 281.0MB. Free memory was 235.3MB in the beginning and 232.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 08:52:52,739 INFO L158 Benchmark]: Boogie Preprocessor took 30.20ms. Allocated memory is still 281.0MB. Free memory was 232.2MB in the beginning and 229.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 08:52:52,739 INFO L158 Benchmark]: RCFGBuilder took 580.45ms. Allocated memory is still 281.0MB. Free memory was 229.5MB in the beginning and 204.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-06 08:52:52,739 INFO L158 Benchmark]: TraceAbstraction took 690735.50ms. Allocated memory was 281.0MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 202.8MB in the beginning and 995.7MB in the end (delta: -792.9MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2024-05-06 08:52:52,740 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 158.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 643.43ms. Allocated memory is still 281.0MB. Free memory was 209.0MB in the beginning and 235.3MB in the end (delta: -26.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.27ms. Allocated memory is still 281.0MB. Free memory was 235.3MB in the beginning and 232.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.20ms. Allocated memory is still 281.0MB. Free memory was 232.2MB in the beginning and 229.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 580.45ms. Allocated memory is still 281.0MB. Free memory was 229.5MB in the beginning and 204.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 690735.50ms. Allocated memory was 281.0MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 202.8MB in the beginning and 995.7MB in the end (delta: -792.9MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown