/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 00:58:45,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 00:58:45,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 00:58:45,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 00:58:45,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 00:58:45,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 00:58:45,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 00:58:45,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 00:58:45,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 00:58:45,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 00:58:45,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 00:58:45,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 00:58:45,805 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 00:58:45,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 00:58:45,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 00:58:45,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 00:58:45,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 00:58:45,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 00:58:45,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 00:58:45,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 00:58:45,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 00:58:45,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 00:58:45,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 00:58:45,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 00:58:45,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 00:58:45,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 00:58:45,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 00:58:45,812 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 00:58:45,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 00:58:45,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 00:58:45,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 00:58:45,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 00:58:45,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 00:58:45,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 00:58:45,813 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 00:58:45,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 00:58:45,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 00:58:45,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 00:58:45,815 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 00:58:45,815 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 [2024-04-04 00:58:46,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 00:58:46,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 00:58:46,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 00:58:46,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 00:58:46,078 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 00:58:46,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2024-04-04 00:58:47,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 00:58:47,350 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 00:58:47,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2024-04-04 00:58:47,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4d5af3eea/394c8b27b748438f963cf15febf2be4a/FLAG45b6d0b67 [2024-04-04 00:58:47,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4d5af3eea/394c8b27b748438f963cf15febf2be4a [2024-04-04 00:58:47,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 00:58:47,379 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 00:58:47,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 00:58:47,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 00:58:47,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 00:58:47,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b3c87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47, skipping insertion in model container [2024-04-04 00:58:47,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,417 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 00:58:47,753 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_ok.i[43266,43279] [2024-04-04 00:58:47,760 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_ok.i[43543,43556] [2024-04-04 00:58:47,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 00:58:47,775 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 00:58:47,821 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_ok.i[43266,43279] [2024-04-04 00:58:47,827 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_ok.i[43543,43556] [2024-04-04 00:58:47,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 00:58:47,885 INFO L206 MainTranslator]: Completed translation [2024-04-04 00:58:47,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47 WrapperNode [2024-04-04 00:58:47,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 00:58:47,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 00:58:47,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 00:58:47,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 00:58:47,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,933 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2024-04-04 00:58:47,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 00:58:47,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 00:58:47,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 00:58:47,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 00:58:47,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 00:58:47,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 00:58:47,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 00:58:47,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 00:58:47,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (1/1) ... [2024-04-04 00:58:47,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 00:58:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:48,019 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-04-04 00:58:48,047 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-04-04 00:58:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-04 00:58:48,090 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-04 00:58:48,090 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 00:58:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 00:58:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 00:58:48,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 00:58:48,092 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 00:58:48,214 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 00:58:48,215 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 00:58:48,417 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 00:58:48,450 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 00:58:48,450 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-04 00:58:48,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 12:58:48 BoogieIcfgContainer [2024-04-04 00:58:48,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 00:58:48,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 00:58:48,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 00:58:48,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 00:58:48,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 12:58:47" (1/3) ... [2024-04-04 00:58:48,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7181c467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 12:58:48, skipping insertion in model container [2024-04-04 00:58:48,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:58:47" (2/3) ... [2024-04-04 00:58:48,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7181c467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 12:58:48, skipping insertion in model container [2024-04-04 00:58:48,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 12:58:48" (3/3) ... [2024-04-04 00:58:48,468 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-04-04 00:58:48,475 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 00:58:48,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 00:58:48,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-04 00:58:48,485 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 00:58:48,599 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-04 00:58:48,634 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 00:58:48,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 00:58:48,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:48,637 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-04-04 00:58:48,638 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-04-04 00:58:48,690 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 00:58:48,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:48,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 00:58:48,710 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;@34a01f6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 00:58:48,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-04 00:58:48,755 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 2 more)] === [2024-04-04 00:58:48,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1100909939, now seen corresponding path program 1 times [2024-04-04 00:58:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533427892] [2024-04-04 00:58:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533427892] [2024-04-04 00:58:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533427892] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:58:49,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:58:49,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 00:58:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582991096] [2024-04-04 00:58:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:58:49,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 00:58:49,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 00:58:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 00:58:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:49,078 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-04-04 00:58:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 00:58:49,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:49,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1323198379, now seen corresponding path program 1 times [2024-04-04 00:58:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432077902] [2024-04-04 00:58:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432077902] [2024-04-04 00:58:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432077902] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:58:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:58:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-04 00:58:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088379045] [2024-04-04 00:58:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:58:49,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-04 00:58:49,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:49,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-04 00:58:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-04 00:58:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:49,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-04-04 00:58:49,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:49,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 00:58:49,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:49,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2002901627, now seen corresponding path program 1 times [2024-04-04 00:58:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:49,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646374726] [2024-04-04 00:58:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646374726] [2024-04-04 00:58:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646374726] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:58:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:58:49,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-04 00:58:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174487140] [2024-04-04 00:58:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:58:49,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-04 00:58:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-04 00:58:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-04 00:58:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:49,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-04-04 00:58:49,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:49,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:49,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 00:58:49,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:49,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1898140429, now seen corresponding path program 1 times [2024-04-04 00:58:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:49,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355871666] [2024-04-04 00:58:49,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355871666] [2024-04-04 00:58:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355871666] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:58:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348628285] [2024-04-04 00:58:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:50,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:50,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:50,211 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-04-04 00:58:50,212 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-04-04 00:58:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:50,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-04 00:58:50,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:58:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:50,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:58:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348628285] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:58:50,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:58:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-04-04 00:58:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456257911] [2024-04-04 00:58:50,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:58:50,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-04 00:58:50,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:50,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-04 00:58:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-04-04 00:58:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:50,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:50,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 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-04-04 00:58:50,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:50,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:50,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:50,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:50,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-04 00:58:50,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:50,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:50,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash 44387869, now seen corresponding path program 2 times [2024-04-04 00:58:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:50,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261524489] [2024-04-04 00:58:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261524489] [2024-04-04 00:58:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261524489] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:58:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89410317] [2024-04-04 00:58:51,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 00:58:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:51,129 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-04-04 00:58:51,144 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-04-04 00:58:51,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-04-04 00:58:51,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:58:51,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2024-04-04 00:58:51,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:58:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-04-04 00:58:51,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-04 00:58:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89410317] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:58:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-04 00:58:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-04-04 00:58:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646306828] [2024-04-04 00:58:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:58:51,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-04 00:58:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-04 00:58:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-04-04 00:58:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:51,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:51,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-04-04 00:58:51,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:51,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:51,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:51,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:51,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:51,370 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-04-04 00:58:51,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:51,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:51,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash 26985882, now seen corresponding path program 1 times [2024-04-04 00:58:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940438019] [2024-04-04 00:58:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940438019] [2024-04-04 00:58:51,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940438019] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:58:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964393448] [2024-04-04 00:58:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:51,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:58:51,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-04 00:58:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:52,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 8 conjunts are in the unsatisfiable core [2024-04-04 00:58:52,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:58:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:52,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:58:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964393448] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:58:52,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:58:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-04-04 00:58:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336532501] [2024-04-04 00:58:52,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:58:52,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-04 00:58:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:52,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-04 00:58:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-04-04 00:58:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:52,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:52,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.27777777777778) internal successors, (383), 18 states have internal predecessors, (383), 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-04-04 00:58:52,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:52,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:52,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:52,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:52,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:52,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:58:52,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-04 00:58:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:52,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:52,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1417540742, now seen corresponding path program 2 times [2024-04-04 00:58:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232989921] [2024-04-04 00:58:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232989921] [2024-04-04 00:58:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232989921] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:58:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188379766] [2024-04-04 00:58:53,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 00:58:53,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:53,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:53,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:58:53,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-04 00:58:53,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 00:58:53,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:58:53,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-04 00:58:53,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:58:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:53,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:58:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188379766] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:58:54,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:58:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-04-04 00:58:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542889860] [2024-04-04 00:58:54,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:58:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-04-04 00:58:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-04-04 00:58:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-04-04 00:58:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:54,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:54,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 18.794117647058822) internal successors, (639), 34 states have internal predecessors, (639), 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-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:58:54,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:58:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:58:54,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-04-04 00:58:54,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-04-04 00:58:54,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:54,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash -124479686, now seen corresponding path program 3 times [2024-04-04 00:58:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:54,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332994036] [2024-04-04 00:58:54,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:54,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:58:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:58:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:58:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332994036] [2024-04-04 00:58:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332994036] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:58:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643086163] [2024-04-04 00:58:56,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-04 00:58:56,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:56,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:58:56,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:58:56,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-04 00:58:56,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-04-04 00:58:56,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:58:56,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 73 conjunts are in the unsatisfiable core [2024-04-04 00:58:56,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:58:58,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-04 00:58:58,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:58:58,679 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-04-04 00:58:58,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:58:58,882 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 27 treesize of output 11 [2024-04-04 00:58:58,972 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-04-04 00:58:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 801 proven. 0 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2024-04-04 00:58:59,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-04 00:58:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643086163] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:58:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-04 00:58:59,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [33] total 44 [2024-04-04 00:58:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871903992] [2024-04-04 00:58:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:58:59,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-04 00:58:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:58:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-04 00:58:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2024-04-04 00:58:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:59,045 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:58:59,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.384615384615383) internal successors, (226), 13 states have internal predecessors, (226), 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-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:58:59,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:58:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:58:59,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-04 00:58:59,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:58:59,604 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:58:59,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:58:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1675942950, now seen corresponding path program 1 times [2024-04-04 00:58:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:58:59,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568753009] [2024-04-04 00:58:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:58:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:58:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:59:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 0 proven. 3840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:59:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:59:01,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568753009] [2024-04-04 00:59:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568753009] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:59:01,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732461834] [2024-04-04 00:59:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:59:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:59:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:59:01,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:59:01,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-04 00:59:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:59:01,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 34 conjunts are in the unsatisfiable core [2024-04-04 00:59:01,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:59:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 0 proven. 3840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:59:01,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:59:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 0 proven. 3840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:59:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732461834] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:59:02,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:59:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2024-04-04 00:59:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64425478] [2024-04-04 00:59:02,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:59:02,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-04-04 00:59:02,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:59:02,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-04-04 00:59:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-04-04 00:59:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:02,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:59:02,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 20.976744186046513) internal successors, (902), 43 states have internal predecessors, (902), 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-04-04 00:59:02,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:02,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-04 00:59:03,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-04 00:59:04,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-04-04 00:59:04,114 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:59:04,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:59:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -350829316, now seen corresponding path program 2 times [2024-04-04 00:59:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:59:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333462176] [2024-04-04 00:59:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:59:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:59:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:59:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6701 backedges. 6131 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:59:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:59:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333462176] [2024-04-04 00:59:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333462176] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:59:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860176469] [2024-04-04 00:59:06,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 00:59:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:59:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:59:06,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:59:06,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-04-04 00:59:06,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 00:59:06,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:59:06,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 42 conjunts are in the unsatisfiable core [2024-04-04 00:59:06,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:59:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6701 backedges. 6701 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:59:07,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-04 00:59:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860176469] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:59:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-04 00:59:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2024-04-04 00:59:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669941416] [2024-04-04 00:59:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:59:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-04-04 00:59:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:59:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-04-04 00:59:07,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2024-04-04 00:59:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:07,491 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:59:07,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.697674418604652) internal successors, (847), 43 states have internal predecessors, (847), 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-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:07,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:07,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:07,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-04 00:59:07,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-04 00:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-04 00:59:08,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-04-04 00:59:08,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:59:08,587 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:59:08,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:59:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash -800486524, now seen corresponding path program 3 times [2024-04-04 00:59:08,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:59:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019965576] [2024-04-04 00:59:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:59:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:59:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:59:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3823 proven. 119 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2024-04-04 00:59:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:59:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019965576] [2024-04-04 00:59:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019965576] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:59:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272557040] [2024-04-04 00:59:20,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-04 00:59:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:59:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:59:20,253 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:59:20,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-04-04 00:59:20,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-04-04 00:59:20,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:59:20,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 88 conjunts are in the unsatisfiable core [2024-04-04 00:59:20,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:59:23,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-04 00:59:23,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:23,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 16 treesize of output 11 [2024-04-04 00:59:23,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:23,506 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 27 treesize of output 11 [2024-04-04 00:59:23,547 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-04-04 00:59:23,688 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 23 treesize of output 3 [2024-04-04 00:59:23,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:23,767 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-04-04 00:59:23,956 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-04-04 00:59:23,957 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-04-04 00:59:23,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 23 treesize of output 11 [2024-04-04 00:59:24,009 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-04-04 00:59:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1731 proven. 418 refuted. 0 times theorem prover too weak. 3931 trivial. 0 not checked. [2024-04-04 00:59:24,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:59:24,081 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 10 treesize of output 4 [2024-04-04 00:59:24,312 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-04 00:59:24,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-04 00:59:24,364 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))))) is different from false [2024-04-04 00:59:24,377 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse3)) 20))))) is different from false [2024-04-04 00:59:24,429 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse3))))))) is different from false [2024-04-04 00:59:24,476 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (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|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse1)) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|)))) is different from false [2024-04-04 00:59:24,512 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse3)) 20))))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131|)))) is different from false [2024-04-04 00:59:24,552 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse3)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131|))))) is different from false [2024-04-04 00:59:25,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 00:59:25,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 129 [2024-04-04 00:59:25,446 INFO L349 Elim1Store]: treesize reduction 31, result has 60.3 percent of original size [2024-04-04 00:59:25,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 220 [2024-04-04 00:59:25,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 00:59:25,474 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 152 treesize of output 144 [2024-04-04 00:59:25,480 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 59 treesize of output 47 [2024-04-04 00:59:25,513 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 8 treesize of output 4 [2024-04-04 00:59:25,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 00:59:25,530 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 47 treesize of output 47 [2024-04-04 00:59:25,544 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-04-04 00:59:25,551 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:25,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 97 treesize of output 81 [2024-04-04 00:59:25,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:25,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:25,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:25,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-04-04 00:59:25,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:25,568 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-04 00:59:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1333 proven. 397 refuted. 0 times theorem prover too weak. 3931 trivial. 419 not checked. [2024-04-04 00:59:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272557040] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:59:26,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:59:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20, 24] total 69 [2024-04-04 00:59:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234005344] [2024-04-04 00:59:26,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:59:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-04-04 00:59:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:59:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-04-04 00:59:26,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=3167, Unknown=11, NotChecked=1000, Total=4692 [2024-04-04 00:59:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:26,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:59:26,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 10.27536231884058) internal successors, (709), 69 states have internal predecessors, (709), 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-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-04 00:59:26,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-04 00:59:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-04-04 00:59:28,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-04-04 00:59:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:59:28,390 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 00:59:28,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:59:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1972776899, now seen corresponding path program 4 times [2024-04-04 00:59:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:59:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801885864] [2024-04-04 00:59:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:59:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:59:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:59:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3589 proven. 552 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2024-04-04 00:59:35,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:59:35,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801885864] [2024-04-04 00:59:35,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801885864] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:59:35,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643691437] [2024-04-04 00:59:35,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-04 00:59:35,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:59:35,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:59:35,613 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:59:35,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-04-04 00:59:43,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-04 00:59:43,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:59:43,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 98 conjunts are in the unsatisfiable core [2024-04-04 00:59:43,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:59:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-04 00:59:44,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:44,915 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-04-04 00:59:45,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:45,105 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 27 treesize of output 11 [2024-04-04 00:59:45,134 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-04-04 00:59:45,235 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 19 treesize of output 11 [2024-04-04 00:59:45,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:45,288 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-04-04 00:59:45,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:45,460 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 27 treesize of output 11 [2024-04-04 00:59:45,492 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-04-04 00:59:45,626 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 19 treesize of output 11 [2024-04-04 00:59:45,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:45,692 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-04-04 00:59:45,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:45,880 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 27 treesize of output 11 [2024-04-04 00:59:45,910 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-04-04 00:59:46,037 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 19 treesize of output 11 [2024-04-04 00:59:46,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 00:59:46,099 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-04-04 00:59:46,226 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-04-04 00:59:46,252 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-04-04 00:59:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 4189 proven. 402 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-04-04 00:59:46,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:59:46,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-04 00:59:46,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-04 00:59:46,627 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-04 00:59:46,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-04 00:59:46,658 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (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|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1)) 20))) is different from false [2024-04-04 00:59:46,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int)) (let ((.cse1 (+ 84 |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_236|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int)) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse3)) 20)))))) is different from false [2024-04-04 00:59:46,680 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse3)) 20))))) is different from false [2024-04-04 00:59:47,351 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1))))))) is different from false [2024-04-04 00:59:47,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (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|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1))))))) is different from false [2024-04-04 00:59:47,400 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20)))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|)))) is different from false [2024-04-04 00:59:47,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse7 .cse1) 1)))))) (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse3) 20)) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|)))))) is different from false [2024-04-04 00:59:48,241 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 .cse6 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20))))))) is different from false [2024-04-04 00:59:48,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (v_ArrVal_2296 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20))))))) is different from false [2024-04-04 00:59:48,664 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (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|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|)))))) is different from false [2024-04-04 00:59:48,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1)))))))) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244|)))) is different from false [2024-04-04 00:59:48,792 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse10 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse10 .cse3) 1)))))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse9 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|))))))) is different from false [2024-04-04 00:59:49,170 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (v_ArrVal_2292 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2292) |c_~#queue~0.base|))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse8 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244|) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|)))))) is different from false [2024-04-04 00:59:49,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 00:59:49,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1286 treesize of output 886 [2024-04-04 00:59:49,314 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-04-04 00:59:49,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1188 treesize of output 968 [2024-04-04 00:59:49,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 00:59:49,347 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 463 treesize of output 447 [2024-04-04 00:59:49,358 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 170 treesize of output 158 [2024-04-04 00:59:49,368 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 13 treesize of output 9 [2024-04-04 00:59:49,378 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 13 treesize of output 9 [2024-04-04 00:59:49,387 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 13 treesize of output 9 [2024-04-04 00:59:49,427 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 8 treesize of output 4 [2024-04-04 00:59:49,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:49,435 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:49,435 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:49,470 INFO L349 Elim1Store]: treesize reduction 70, result has 40.7 percent of original size [2024-04-04 00:59:49,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 64 treesize of output 66 [2024-04-04 00:59:49,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-04 00:59:49,505 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 217 treesize of output 193 [2024-04-04 00:59:49,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:49,621 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-04 00:59:49,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 00:59:49,627 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-04 00:59:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3727 proven. 289 refuted. 3 times theorem prover too weak. 1779 trivial. 572 not checked. [2024-04-04 00:59:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643691437] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:59:51,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:59:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 40] total 100 [2024-04-04 00:59:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132740572] [2024-04-04 00:59:51,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:59:51,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-04-04 00:59:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:59:51,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-04-04 00:59:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=5745, Unknown=74, NotChecked=3026, Total=9900 [2024-04-04 00:59:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:51,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:59:51,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 8.97) internal successors, (897), 100 states have internal predecessors, (897), 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-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-04-04 00:59:51,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-04 01:00:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-04 01:00:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-04 01:00:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-04-04 01:00:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-04-04 01:00:02,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-04-04 01:00:02,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-04-04 01:00:02,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-04 01:00:02,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 01:00:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1860575481, now seen corresponding path program 5 times [2024-04-04 01:00:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 01:00:02,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881578561] [2024-04-04 01:00:02,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 01:00:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 01:00:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 01:00:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4457 proven. 1052 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-04-04 01:00:19,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 01:00:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881578561] [2024-04-04 01:00:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881578561] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 01:00:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519181305] [2024-04-04 01:00:19,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-04 01:00:19,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:00:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 01:00:19,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 01:00:19,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-04-04 01:05:16,437 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-04-04 01:05:16,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 01:05:16,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 408 conjunts are in the unsatisfiable core [2024-04-04 01:05:16,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 01:05:16,625 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 13 treesize of output 9 [2024-04-04 01:05:16,661 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:16,661 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 33 treesize of output 27 [2024-04-04 01:05:16,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:17,004 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:17,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 66 [2024-04-04 01:05:17,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:17,075 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 54 treesize of output 38 [2024-04-04 01:05:17,317 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 66 treesize of output 44 [2024-04-04 01:05:17,448 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:17,449 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 68 treesize of output 56 [2024-04-04 01:05:17,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:17,791 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:17,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 66 [2024-04-04 01:05:17,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:17,842 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 54 treesize of output 38 [2024-04-04 01:05:18,052 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 66 treesize of output 44 [2024-04-04 01:05:18,163 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:18,163 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 68 treesize of output 56 [2024-04-04 01:05:18,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:18,518 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:18,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 66 [2024-04-04 01:05:18,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:18,587 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 54 treesize of output 38 [2024-04-04 01:05:18,882 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 66 treesize of output 44 [2024-04-04 01:05:19,025 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:19,025 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 68 treesize of output 56 [2024-04-04 01:05:19,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:19,585 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:19,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 95 treesize of output 85 [2024-04-04 01:05:19,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:19,693 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 79 treesize of output 57 [2024-04-04 01:05:20,134 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 91 treesize of output 63 [2024-04-04 01:05:20,351 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:20,352 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 93 treesize of output 75 [2024-04-04 01:05:21,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:21,235 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:21,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 120 treesize of output 104 [2024-04-04 01:05:21,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:21,431 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 104 treesize of output 76 [2024-04-04 01:05:22,089 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 116 treesize of output 82 [2024-04-04 01:05:22,461 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:22,461 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 118 treesize of output 94 [2024-04-04 01:05:23,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:23,663 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:23,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 145 treesize of output 123 [2024-04-04 01:05:23,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:23,861 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 129 treesize of output 95 [2024-04-04 01:05:24,610 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 141 treesize of output 101 [2024-04-04 01:05:25,072 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:25,073 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 143 treesize of output 113 [2024-04-04 01:05:26,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:26,563 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:26,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 196 treesize of output 150 [2024-04-04 01:05:26,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:26,815 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 180 treesize of output 122 [2024-04-04 01:05:27,794 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 192 treesize of output 128 [2024-04-04 01:05:28,471 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-04 01:05:28,472 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 194 treesize of output 140 [2024-04-04 01:05:29,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:29,351 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-04 01:05:29,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 66 [2024-04-04 01:05:29,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:29,417 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 54 treesize of output 38 [2024-04-04 01:05:29,658 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 23 treesize of output 13 [2024-04-04 01:05:29,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:29,762 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 33 treesize of output 13 [2024-04-04 01:05:30,279 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:30,290 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-04 01:05:30,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 35 [2024-04-04 01:05:30,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:30,325 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 29 treesize of output 13 [2024-04-04 01:05:30,704 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 23 treesize of output 13 [2024-04-04 01:05:30,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:30,828 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 33 treesize of output 13 [2024-04-04 01:05:31,357 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:31,363 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-04 01:05:31,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 35 [2024-04-04 01:05:31,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:31,400 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 29 treesize of output 13 [2024-04-04 01:05:31,869 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 23 treesize of output 13 [2024-04-04 01:05:32,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:32,003 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 33 treesize of output 13 [2024-04-04 01:05:32,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:32,677 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-04 01:05:32,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 35 [2024-04-04 01:05:32,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:32,734 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 29 treesize of output 13 [2024-04-04 01:05:33,139 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 29 treesize of output 3 [2024-04-04 01:05:33,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:33,299 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 33 treesize of output 13 [2024-04-04 01:05:33,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:33,923 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-04 01:05:33,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-04 01:05:33,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:33,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 29 treesize of output 13 [2024-04-04 01:05:34,283 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 46 treesize of output 15 [2024-04-04 01:05:34,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:34,409 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 33 treesize of output 13 [2024-04-04 01:05:35,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:35,027 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-04 01:05:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-04 01:05:35,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:35,068 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 29 treesize of output 13 [2024-04-04 01:05:35,413 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 46 treesize of output 15 [2024-04-04 01:05:35,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:35,555 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 33 treesize of output 13 [2024-04-04 01:05:36,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:36,303 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-04 01:05:36,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-04 01:05:36,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:36,350 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 29 treesize of output 13 [2024-04-04 01:05:36,728 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 46 treesize of output 15 [2024-04-04 01:05:36,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:36,940 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 33 treesize of output 13 [2024-04-04 01:05:37,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-04 01:05:37,683 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-04 01:05:37,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-04 01:05:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:37,730 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 29 treesize of output 13 [2024-04-04 01:05:38,171 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 46 treesize of output 15 [2024-04-04 01:05:38,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-04 01:05:38,342 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 43 treesize of output 13 [2024-04-04 01:05:38,790 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-04-04 01:05:38,790 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 42 treesize of output 16 [2024-04-04 01:05:38,797 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 29 treesize of output 13 [2024-04-04 01:05:38,802 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 19 treesize of output 7 [2024-04-04 01:05:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4074 proven. 2327 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-04-04 01:05:38,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 01:05:57,716 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-04-04 01:05:57,717 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-04-04 01:05:57,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-04-04 01:05:57,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-04-04 01:05:57,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 01:05:57,918 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) 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:337) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-04-04 01:05:57,922 INFO L158 Benchmark]: Toolchain (without parser) took 430542.50ms. Allocated memory was 293.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 221.8MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 733.5MB. Max. memory is 8.0GB. [2024-04-04 01:05:57,922 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 01:05:57,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.96ms. Allocated memory is still 293.6MB. Free memory was 221.6MB in the beginning and 253.8MB in the end (delta: -32.2MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2024-04-04 01:05:57,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.33ms. Allocated memory is still 293.6MB. Free memory was 253.8MB in the beginning and 250.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:05:57,922 INFO L158 Benchmark]: Boogie Preprocessor took 33.69ms. Allocated memory is still 293.6MB. Free memory was 250.7MB in the beginning and 248.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 01:05:57,922 INFO L158 Benchmark]: RCFGBuilder took 482.51ms. Allocated memory is still 293.6MB. Free memory was 248.6MB in the beginning and 225.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-04-04 01:05:57,922 INFO L158 Benchmark]: TraceAbstraction took 429467.42ms. Allocated memory was 293.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 224.5MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 735.9MB. Max. memory is 8.0GB. [2024-04-04 01:05:57,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 504.96ms. Allocated memory is still 293.6MB. Free memory was 221.6MB in the beginning and 253.8MB in the end (delta: -32.2MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.33ms. Allocated memory is still 293.6MB. Free memory was 253.8MB in the beginning and 250.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.69ms. Allocated memory is still 293.6MB. Free memory was 250.7MB in the beginning and 248.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 482.51ms. Allocated memory is still 293.6MB. Free memory was 248.6MB in the beginning and 225.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 429467.42ms. Allocated memory was 293.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 224.5MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 735.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-04 01:05:57,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...