/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:51:37,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:51:37,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 16:51:37,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 16:51:37,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 16:51:37,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:51:37,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 16:51:37,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 16:51:37,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:51:37,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:51:37,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:51:37,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:51:37,723 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:51:37,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:51:37,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:51:37,724 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:51:37,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:51:37,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:51:37,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:51:37,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:51:37,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:51:37,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:51:37,725 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:51:37,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:51:37,726 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:51:37,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:51:37,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:51:37,726 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:51:37,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:51:37,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:51:37,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 16:51:37,728 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 16:51:37,729 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/UAutomizer-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 -> PSEUDO_LOCKSTEP [2023-11-17 16:51:37,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:51:37,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:51:37,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:51:37,877 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:51:37,878 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:51:37,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-11-17 16:51:38,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:51:39,106 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:51:39,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-11-17 16:51:39,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456db8194/240464c2cd814cd69ac4f3d41968844b/FLAG37b2c13c3 [2023-11-17 16:51:39,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456db8194/240464c2cd814cd69ac4f3d41968844b [2023-11-17 16:51:39,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:51:39,138 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:51:39,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:51:39,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:51:39,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:51:39,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446c41b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39, skipping insertion in model container [2023-11-17 16:51:39,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,187 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:51:39,510 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] [2023-11-17 16:51:39,516 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] [2023-11-17 16:51:39,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:51:39,531 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:51:39,578 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] [2023-11-17 16:51:39,582 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] [2023-11-17 16:51:39,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:51:39,639 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:51:39,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39 WrapperNode [2023-11-17 16:51:39,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:51:39,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:51:39,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:51:39,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:51:39,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,705 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2023-11-17 16:51:39,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:51:39,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:51:39,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:51:39,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:51:39,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:51:39,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:51:39,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:51:39,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:51:39,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (1/1) ... [2023-11-17 16:51:39,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:51:39,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:39,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 16:51:39,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 16:51:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-17 16:51:39,780 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-17 16:51:39,780 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 16:51:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:51:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:51:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:51:39,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:51:39,782 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:51:39,907 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:51:39,908 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:51:40,158 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:51:40,180 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:51:40,181 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 16:51:40,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:51:40 BoogieIcfgContainer [2023-11-17 16:51:40,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:51:40,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:51:40,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:51:40,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:51:40,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:51:39" (1/3) ... [2023-11-17 16:51:40,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2bdc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:51:40, skipping insertion in model container [2023-11-17 16:51:40,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:51:39" (2/3) ... [2023-11-17 16:51:40,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2bdc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:51:40, skipping insertion in model container [2023-11-17 16:51:40,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:51:40" (3/3) ... [2023-11-17 16:51:40,187 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-17 16:51:40,192 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 16:51:40,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:51:40,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 16:51:40,199 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:51:40,287 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 16:51:40,324 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 16:51:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:40,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 16:51:40,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 16:51:40,372 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 16:51:40,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 16:51:40,391 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;@109128f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:40,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 16:51:40,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:51:40,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1100909939, now seen corresponding path program 1 times [2023-11-17 16:51:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879998866] [2023-11-17 16:51:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879998866] [2023-11-17 16:51:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879998866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:40,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:51:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848169961] [2023-11-17 16:51:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:40,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 16:51:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 16:51:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 16:51:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:40,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:40,642 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) [2023-11-17 16:51:40,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:40,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 16:51:40,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 16:51:40,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 16:51:40,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:51:40,850 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-17 16:51:40,852 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2023-11-17 16:51:40,856 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:40,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 16:51:40,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:40,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 16:51:40,914 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 16:51:40,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2023-11-17 16:51:40,915 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;@109128f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:51:40,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 16:51:40,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-11-17 16:51:41,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:41,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1199456630, now seen corresponding path program 1 times [2023-11-17 16:51:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576288583] [2023-11-17 16:51:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576288583] [2023-11-17 16:51:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576288583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:41,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:51:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298445606] [2023-11-17 16:51:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:41,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 16:51:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 16:51:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 16:51:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,104 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:41,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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) [2023-11-17 16:51:41,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:51:41,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:41,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash -331165566, now seen corresponding path program 1 times [2023-11-17 16:51:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057300903] [2023-11-17 16:51:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:41,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057300903] [2023-11-17 16:51:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057300903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:41,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:51:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656075084] [2023-11-17 16:51:41,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:41,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:51:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:51:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:51:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:41,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2023-11-17 16:51:41,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:41,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:51:41,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:41,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1763940216, now seen corresponding path program 1 times [2023-11-17 16:51:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:41,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154815389] [2023-11-17 16:51:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154815389] [2023-11-17 16:51:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154815389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:51:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:51:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129763110] [2023-11-17 16:51:41,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:41,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:51:41,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:51:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:51:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:41,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:51:41,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:41,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:41,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:51:41,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:41,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash 261530700, now seen corresponding path program 1 times [2023-11-17 16:51:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:41,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615310269] [2023-11-17 16:51:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615310269] [2023-11-17 16:51:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615310269] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614372902] [2023-11-17 16:51:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:41,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:41,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:41,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:41,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 16:51:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:42,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-17 16:51:42,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:42,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:51:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614372902] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:51:42,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:51:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-17 16:51:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508052080] [2023-11-17 16:51:42,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:51:42,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 16:51:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 16:51:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-17 16:51:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:42,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 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) [2023-11-17 16:51:42,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:42,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:42,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:42,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:42,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1438684324, now seen corresponding path program 2 times [2023-11-17 16:51:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495500605] [2023-11-17 16:51:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495500605] [2023-11-17 16:51:42,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495500605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:42,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554402341] [2023-11-17 16:51:42,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:51:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:42,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:42,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 16:51:42,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-17 16:51:42,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:51:42,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-17 16:51:42,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-17 16:51:42,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 16:51:42,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554402341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:51:42,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 16:51:42,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-17 16:51:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615273317] [2023-11-17 16:51:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:51:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:51:42,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:51:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-17 16:51:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,959 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:42,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 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) [2023-11-17 16:51:42,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:42,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:43,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:43,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:43,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:43,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash -575044485, now seen corresponding path program 1 times [2023-11-17 16:51:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234709142] [2023-11-17 16:51:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234709142] [2023-11-17 16:51:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234709142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189518882] [2023-11-17 16:51:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:43,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:43,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:43,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 16:51:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:43,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:51:43,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:43,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:51:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189518882] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:51:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:51:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-17 16:51:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818280236] [2023-11-17 16:51:43,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:51:43,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:51:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:51:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:51:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:43,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:43,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.055555555555557) internal successors, (361), 18 states have internal predecessors, (361), 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) [2023-11-17 16:51:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:43,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:43,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:43,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:51:44,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:44,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:44,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1570819493, now seen corresponding path program 2 times [2023-11-17 16:51:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:44,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12480722] [2023-11-17 16:51:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12480722] [2023-11-17 16:51:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12480722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620069454] [2023-11-17 16:51:44,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:51:44,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:44,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:44,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:44,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 16:51:45,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:51:45,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:51:45,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-17 16:51:45,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:45,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:51:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620069454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:51:45,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:51:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-11-17 16:51:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066421011] [2023-11-17 16:51:45,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:51:45,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 16:51:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 16:51:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-11-17 16:51:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:45,609 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:45,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 18.147058823529413) internal successors, (617), 34 states have internal predecessors, (617), 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) [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:51:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:51:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:51:46,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 16:51:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:46,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:46,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 158371355, now seen corresponding path program 3 times [2023-11-17 16:51:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586582506] [2023-11-17 16:51:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586582506] [2023-11-17 16:51:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586582506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915013101] [2023-11-17 16:51:47,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:51:47,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:47,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:47,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:47,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 16:51:47,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:51:47,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:51:47,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-17 16:51:47,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:49,113 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 [2023-11-17 16:51:49,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:51:49,164 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 18 treesize of output 13 [2023-11-17 16:51:49,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:51:49,340 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-17 16:51:49,340 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 [2023-11-17 16:51:49,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:51:49,397 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 [2023-11-17 16:51:49,416 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 9 treesize of output 3 [2023-11-17 16:51:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 482 proven. 319 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2023-11-17 16:51:49,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:51:49,674 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_834 (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_834) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2023-11-17 16:51:49,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:49,694 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 49 treesize of output 40 [2023-11-17 16:51:49,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:49,700 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 63 treesize of output 65 [2023-11-17 16:51:49,708 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 [2023-11-17 16:51:49,725 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 [2023-11-17 16:51:49,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:51:49,733 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 39 [2023-11-17 16:51:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 391 proven. 319 refuted. 0 times theorem prover too weak. 2574 trivial. 91 not checked. [2023-11-17 16:51:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915013101] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:51:50,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:51:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 13] total 54 [2023-11-17 16:51:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728587271] [2023-11-17 16:51:50,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:51:50,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-17 16:51:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-17 16:51:50,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2390, Unknown=1, NotChecked=102, Total=2862 [2023-11-17 16:51:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:50,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:50,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 16.703703703703702) internal successors, (902), 54 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) [2023-11-17 16:51:50,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:50,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:50,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:50,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:50,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:50,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:51:50,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:51:50,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:51:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:51:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2023-11-17 16:51:55,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-17 16:51:55,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:55,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:51:55,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:51:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash 210112051, now seen corresponding path program 1 times [2023-11-17 16:51:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:51:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010629459] [2023-11-17 16:51:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:51:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4337 backedges. 0 proven. 4337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:51:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010629459] [2023-11-17 16:51:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010629459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:51:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692171996] [2023-11-17 16:51:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:51:57,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:51:57,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:51:57,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:51:57,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 16:51:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:51:57,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:51:57,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:51:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4337 backedges. 0 proven. 4337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:58,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:51:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4337 backedges. 0 proven. 4337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:51:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692171996] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:51:59,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:51:59,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 43 [2023-11-17 16:51:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140991619] [2023-11-17 16:51:59,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:51:59,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-17 16:51:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:51:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-17 16:51:59,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-11-17 16:51:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:59,287 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:51:59,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 18.906976744186046) internal successors, (813), 43 states have internal predecessors, (813), 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) [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2023-11-17 16:51:59,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2023-11-17 16:52:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:00,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 16:52:00,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 16:52:00,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:52:00,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:52:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2109877597, now seen corresponding path program 2 times [2023-11-17 16:52:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:52:00,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795602200] [2023-11-17 16:52:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:52:00,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:52:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:52:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6701 backedges. 6131 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:52:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:52:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795602200] [2023-11-17 16:52:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795602200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:52:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326021624] [2023-11-17 16:52:02,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:52:02,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:52:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:52:02,222 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:52:02,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 16:52:02,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:52:02,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:52:02,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 16:52:02,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:52:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6701 backedges. 6701 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:52:03,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 16:52:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326021624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:52:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 16:52:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-11-17 16:52:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285025598] [2023-11-17 16:52:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:52:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-17 16:52:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:52:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-17 16:52:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-11-17 16:52:03,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:03,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:52:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.558139534883722) internal successors, (841), 43 states have internal predecessors, (841), 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) [2023-11-17 16:52:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:03,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:03,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2023-11-17 16:52:03,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:03,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2023-11-17 16:52:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:52:04,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 16:52:04,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:52:04,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:52:04,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:52:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1250367973, now seen corresponding path program 3 times [2023-11-17 16:52:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:52:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261740527] [2023-11-17 16:52:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:52:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:52:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:52:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3154 proven. 198 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2023-11-17 16:52:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:52:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261740527] [2023-11-17 16:52:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261740527] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:52:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911251519] [2023-11-17 16:52:14,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:52:14,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:52:14,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:52:14,096 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:52:14,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 16:52:14,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-17 16:52:14,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:52:14,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-17 16:52:14,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:52:17,169 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 [2023-11-17 16:52:17,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:17,238 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 [2023-11-17 16:52:17,425 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 [2023-11-17 16:52:17,459 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 [2023-11-17 16:52:17,590 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 [2023-11-17 16:52:17,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:17,663 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 [2023-11-17 16:52:17,871 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-17 16:52:17,871 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 [2023-11-17 16:52:17,904 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 [2023-11-17 16:52:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 2119 proven. 30 refuted. 0 times theorem prover too weak. 3931 trivial. 0 not checked. [2023-11-17 16:52:17,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:52:18,245 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1938 (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_1938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2023-11-17 16:52:18,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1938 (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_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))))) is different from false [2023-11-17 16:52:18,268 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| Int) (v_ArrVal_1938 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.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 .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124|)))) is different from false [2023-11-17 16:52:18,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| Int) (v_ArrVal_1938 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.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_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124|)))) is different from false [2023-11-17 16:52:18,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_148| Int) (v_ArrVal_1938 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (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|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124|) (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_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1938) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_148|)) .cse3))))))) is different from false [2023-11-17 16:52:18,348 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_148| Int) (v_ArrVal_1938 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (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_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_148|)) .cse1)) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124|))))) is different from false [2023-11-17 16:52:18,366 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_148| Int) (v_ArrVal_1938 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_124|) (not (= (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_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1938) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_148|)) .cse3)) 20)))))) is different from false [2023-11-17 16:52:18,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:52:18,614 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 214 treesize of output 144 [2023-11-17 16:52:18,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:52:18,621 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 185 treesize of output 183 [2023-11-17 16:52:18,626 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 81 treesize of output 69 [2023-11-17 16:52:18,632 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 36 treesize of output 24 [2023-11-17 16:52:18,647 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 [2023-11-17 16:52:18,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:52:18,664 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 64 treesize of output 56 [2023-11-17 16:52:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1461 proven. 397 refuted. 7 times theorem prover too weak. 3931 trivial. 284 not checked. [2023-11-17 16:52:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911251519] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:52:19,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:52:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19, 22] total 67 [2023-11-17 16:52:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981565545] [2023-11-17 16:52:19,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:52:19,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-17 16:52:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:52:19,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-17 16:52:19,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=2960, Unknown=16, NotChecked=854, Total=4422 [2023-11-17 16:52:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:19,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:52:19,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 10.313432835820896) internal successors, (691), 67 states have internal predecessors, (691), 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) [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:19,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:19,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2023-11-17 16:52:19,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:19,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:52:19,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:52:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:52:21,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-17 16:52:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 16:52:21,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:52:21,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:52:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -801293986, now seen corresponding path program 4 times [2023-11-17 16:52:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:52:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571506985] [2023-11-17 16:52:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:52:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:52:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:52:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2429 proven. 218 refuted. 0 times theorem prover too weak. 3723 trivial. 0 not checked. [2023-11-17 16:52:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:52:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571506985] [2023-11-17 16:52:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571506985] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:52:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642672448] [2023-11-17 16:52:31,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:52:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:52:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:52:31,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:52:31,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 16:52:40,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:52:40,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:52:40,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-17 16:52:40,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:52:41,868 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 [2023-11-17 16:52:41,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:41,913 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 [2023-11-17 16:52:42,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:42,063 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 [2023-11-17 16:52:42,098 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 [2023-11-17 16:52:42,205 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 [2023-11-17 16:52:42,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:42,261 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 [2023-11-17 16:52:42,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:42,424 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 [2023-11-17 16:52:42,457 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 [2023-11-17 16:52:42,606 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 [2023-11-17 16:52:42,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:42,681 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 [2023-11-17 16:52:42,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:42,817 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 [2023-11-17 16:52:42,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 23 treesize of output 11 [2023-11-17 16:52:42,942 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 [2023-11-17 16:52:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:42,994 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 [2023-11-17 16:52:43,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:43,110 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 [2023-11-17 16:52:43,126 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 [2023-11-17 16:52:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 4189 proven. 402 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2023-11-17 16:52:43,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:52:43,507 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2332 (Array Int Int))) (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_2332) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))) is different from false [2023-11-17 16:52:43,516 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2332 (Array Int Int))) (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_2332) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))) is different from false [2023-11-17 16:52:43,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2332 (Array Int Int))) (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_2332) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))) is different from false [2023-11-17 16:52:43,562 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2332 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (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_2332) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))) is different from false [2023-11-17 16:52:43,592 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (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_2332) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20))))) is different from false [2023-11-17 16:52:43,606 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1)))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|)))) is different from false [2023-11-17 16:52:43,629 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4)) |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_2332) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse3) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|))))) is different from false [2023-11-17 16:52:44,190 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| 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 .cse5 .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20))))))) is different from false [2023-11-17 16:52:44,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| 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 ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))))) is different from false [2023-11-17 16:52:44,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| 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 ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))))) is different from false [2023-11-17 16:52:44,346 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 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_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 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 ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|)))) is different from false [2023-11-17 16:52:44,387 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse3 (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 ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 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)) .cse4 (+ (select .cse7 .cse4) 1)))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|))))))) is different from false [2023-11-17 16:52:45,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2324 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| 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|)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2324) |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 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_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|))))))) is different from false [2023-11-17 16:52:45,067 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (v_ArrVal_2324 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| 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 .cse8 .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2324) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 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_2328) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20)))))))) is different from false [2023-11-17 16:52:45,173 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (v_ArrVal_2324 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| 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|)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2324) |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|))))))) is different from false [2023-11-17 16:52:45,253 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (v_ArrVal_2324 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (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 ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2324) |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_236|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|))))))) is different from false [2023-11-17 16:52:45,284 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_309| 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_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (v_ArrVal_2324 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_309| 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|)) (.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2324) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_236|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|))))))) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_309|)))) is different from false [2023-11-17 16:52:45,340 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2328 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| Int) (v_ArrVal_2324 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_228| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_309| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse10 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_309| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ (select .cse10 .cse4) 1)))))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2324) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse9 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_236|))) (store (store .cse9 .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_310| 1)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2328) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_232|))) (store (store .cse7 .cse8 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_305| 1)) .cse1 (+ 1 (select .cse7 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2332) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_228|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_309|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_297|)))))))) is different from false [2023-11-17 16:52:46,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:52:46,044 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 1289 treesize of output 889 [2023-11-17 16:52:46,085 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2023-11-17 16:52:46,085 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 1260 treesize of output 1040 [2023-11-17 16:52:46,112 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 [2023-11-17 16:52:46,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:52:46,130 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 452 treesize of output 438 [2023-11-17 16:52:46,174 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 132 treesize of output 124 [2023-11-17 16:52:46,183 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 [2023-11-17 16:52:46,193 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 [2023-11-17 16:52:46,239 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 [2023-11-17 16:52:46,295 INFO L349 Elim1Store]: treesize reduction 38, result has 42.4 percent of original size [2023-11-17 16:52:46,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 44 [2023-11-17 16:52:46,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:52:46,380 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 173 treesize of output 157 [2023-11-17 16:52:46,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:52:46,489 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 230 treesize of output 208 [2023-11-17 16:52:46,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:52:46,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:52:46,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:52:46,504 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 153 treesize of output 141 [2023-11-17 16:52:46,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:52:46,518 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-17 16:52:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3757 proven. 297 refuted. 10 times theorem prover too weak. 1779 trivial. 527 not checked. [2023-11-17 16:52:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642672448] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:52:46,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:52:47,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 40] total 97 [2023-11-17 16:52:47,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002706938] [2023-11-17 16:52:47,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:52:47,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-11-17 16:52:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:52:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-17 16:52:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=5115, Unknown=62, NotChecked=3078, Total=9312 [2023-11-17 16:52:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:47,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:52:47,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 8.639175257731958) internal successors, (838), 97 states have internal predecessors, (838), 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) [2023-11-17 16:52:47,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:47,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:47,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:47,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:47,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:47,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:47,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:47,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2023-11-17 16:52:47,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:47,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:52:47,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:52:47,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:52:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 16:52:57,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 16:52:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 16:52:57,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:52:57,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:52:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 229932968, now seen corresponding path program 5 times [2023-11-17 16:52:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:52:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533226764] [2023-11-17 16:52:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:52:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:52:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:53:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 6161 trivial. 0 not checked. [2023-11-17 16:53:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:53:02,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533226764] [2023-11-17 16:53:02,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533226764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:53:02,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:53:02,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-17 16:53:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145701718] [2023-11-17 16:53:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:53:02,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:53:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:53:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:53:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:53:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:53:02,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 16:53:02,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.894736842105264) internal successors, (188), 19 states have internal predecessors, (188), 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) [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:53:02,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:53:02,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 181 states. [2023-11-17 16:53:02,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:53:02,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:53:02,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:53:02,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 16:53:02,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:53:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 16:53:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:53:04,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 16:53:04,034 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 16:53:04,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:53:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash -814305236, now seen corresponding path program 6 times [2023-11-17 16:53:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:53:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351576603] [2023-11-17 16:53:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:53:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:53:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:53:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4075 proven. 1441 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2023-11-17 16:53:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:53:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351576603] [2023-11-17 16:53:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351576603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:53:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709350339] [2023-11-17 16:53:21,414 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:53:21,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:53:21,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:53:21,415 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:53:21,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2023-11-17 17:00:54,128 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 17:00:54,128 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 17:00:54,128 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 17:00:54,133 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 17:00:55,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-17 17:00:55,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-11-17 17:00:55,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-11-17 17:00:55,328 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2023-11-17 17:00:55,348 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 17:00:55,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-17 17:00:55,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2023-11-17 17:00:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872936590] [2023-11-17 17:00:55,349 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-17 17:00:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-17 17:00:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 17:00:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-17 17:00:55,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=2848, Unknown=0, NotChecked=0, Total=3422 [2023-11-17 17:00:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:00:55,351 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 17:00:55,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 8.966101694915254) internal successors, (529), 59 states have internal predecessors, (529), 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) [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 195 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-17 17:00:55,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 17:00:55,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 17:00:55,354 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2023-11-17 17:00:55,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 17:00:55,355 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1, 1, 1] [2023-11-17 17:00:55,355 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was TIMEOUT (2/2) [2023-11-17 17:00:55,357 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 17:00:55,357 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 17:00:55,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:00:55 BasicIcfg [2023-11-17 17:00:55,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 17:00:55,359 INFO L158 Benchmark]: Toolchain (without parser) took 556221.24ms. Allocated memory was 313.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 274.6MB in the beginning and 1.1GB in the end (delta: -867.1MB). Peak memory consumption was 733.6MB. Max. memory is 8.0GB. [2023-11-17 17:00:55,359 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 17:00:55,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.79ms. Allocated memory is still 313.5MB. Free memory was 274.6MB in the beginning and 244.2MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 17:00:55,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.56ms. Allocated memory is still 313.5MB. Free memory was 244.2MB in the beginning and 241.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 17:00:55,359 INFO L158 Benchmark]: Boogie Preprocessor took 22.59ms. Allocated memory is still 313.5MB. Free memory was 241.0MB in the beginning and 238.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 17:00:55,359 INFO L158 Benchmark]: RCFGBuilder took 453.14ms. Allocated memory is still 313.5MB. Free memory was 238.9MB in the beginning and 216.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 17:00:55,360 INFO L158 Benchmark]: TraceAbstraction took 555175.11ms. Allocated memory was 313.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 215.3MB in the beginning and 1.1GB in the end (delta: -926.3MB). Peak memory consumption was 674.8MB. Max. memory is 8.0GB. [2023-11-17 17:00:55,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2023-11-17 17:00:55,360 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.79ms. Allocated memory is still 313.5MB. Free memory was 274.6MB in the beginning and 244.2MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.56ms. Allocated memory is still 313.5MB. Free memory was 244.2MB in the beginning and 241.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.59ms. Allocated memory is still 313.5MB. Free memory was 241.0MB in the beginning and 238.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 453.14ms. Allocated memory is still 313.5MB. Free memory was 238.9MB in the beginning and 216.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 555175.11ms. Allocated memory was 313.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 215.3MB in the beginning and 1.1GB in the end (delta: -926.3MB). Peak memory consumption was 674.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4918, independent: 4864, independent conditional: 55, independent unconditional: 4809, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4907, independent: 4864, independent conditional: 55, independent unconditional: 4809, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4907, independent: 4864, independent conditional: 55, independent unconditional: 4809, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4916, independent: 4864, independent conditional: 0, independent unconditional: 4864, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4916, independent: 4864, independent conditional: 0, independent unconditional: 4864, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4916, independent: 4864, independent conditional: 0, independent unconditional: 4864, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4721, independent: 4687, independent conditional: 0, independent unconditional: 4687, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4721, independent: 4685, independent conditional: 0, independent unconditional: 4685, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4916, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4721, unknown conditional: 0, unknown unconditional: 4721] , Statistics on independence cache: Total cache size (in pairs): 4721, Positive cache size: 4687, Positive conditional cache size: 0, Positive unconditional cache size: 4687, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1, Independence queries for same thread: 11 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 124, Number of trivial persistent sets: 107, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4843, independent: 4809, independent conditional: 0, independent unconditional: 4809, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4918, independent: 4864, independent conditional: 55, independent unconditional: 4809, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4907, independent: 4864, independent conditional: 55, independent unconditional: 4809, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4907, independent: 4864, independent conditional: 55, independent unconditional: 4809, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4916, independent: 4864, independent conditional: 0, independent unconditional: 4864, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4916, independent: 4864, independent conditional: 0, independent unconditional: 4864, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4916, independent: 4864, independent conditional: 0, independent unconditional: 4864, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4721, independent: 4687, independent conditional: 0, independent unconditional: 4687, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4721, independent: 4685, independent conditional: 0, independent unconditional: 4685, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4916, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4721, unknown conditional: 0, unknown unconditional: 4721] , Statistics on independence cache: Total cache size (in pairs): 4721, Positive cache size: 4687, Positive conditional cache size: 0, Positive unconditional cache size: 4687, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1, Independence queries for same thread: 11 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18947, independent: 18061, independent conditional: 8109, independent unconditional: 9952, dependent: 886, dependent conditional: 843, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18140, independent: 18061, independent conditional: 8109, independent unconditional: 9952, dependent: 79, dependent conditional: 36, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18140, independent: 18061, independent conditional: 8109, independent unconditional: 9952, dependent: 79, dependent conditional: 36, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18286, independent: 18061, independent conditional: 2, independent unconditional: 18059, dependent: 225, dependent conditional: 144, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18286, independent: 18061, independent conditional: 2, independent unconditional: 18059, dependent: 225, dependent conditional: 27, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18286, independent: 18061, independent conditional: 2, independent unconditional: 18059, dependent: 225, dependent conditional: 27, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8473, independent: 8423, independent conditional: 2, independent unconditional: 8421, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8473, independent: 8417, independent conditional: 0, independent unconditional: 8417, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, independent: 41, independent conditional: 4, independent unconditional: 37, dependent: 77, dependent conditional: 12, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18286, independent: 9638, independent conditional: 0, independent unconditional: 9638, dependent: 175, dependent conditional: 20, dependent unconditional: 155, unknown: 8473, unknown conditional: 9, unknown unconditional: 8464] , Statistics on independence cache: Total cache size (in pairs): 8473, Positive cache size: 8423, Positive conditional cache size: 2, Positive unconditional cache size: 8421, Negative cache size: 50, Negative conditional cache size: 7, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 117, Maximal queried relation: 10, Independence queries for same thread: 807 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 307, Number of trivial persistent sets: 119, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9995, independent: 9952, independent conditional: 0, independent unconditional: 9952, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18947, independent: 18061, independent conditional: 8109, independent unconditional: 9952, dependent: 886, dependent conditional: 843, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18140, independent: 18061, independent conditional: 8109, independent unconditional: 9952, dependent: 79, dependent conditional: 36, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18140, independent: 18061, independent conditional: 8109, independent unconditional: 9952, dependent: 79, dependent conditional: 36, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18286, independent: 18061, independent conditional: 2, independent unconditional: 18059, dependent: 225, dependent conditional: 144, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18286, independent: 18061, independent conditional: 2, independent unconditional: 18059, dependent: 225, dependent conditional: 27, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18286, independent: 18061, independent conditional: 2, independent unconditional: 18059, dependent: 225, dependent conditional: 27, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8473, independent: 8423, independent conditional: 2, independent unconditional: 8421, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8473, independent: 8417, independent conditional: 0, independent unconditional: 8417, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, independent: 41, independent conditional: 4, independent unconditional: 37, dependent: 77, dependent conditional: 12, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18286, independent: 9638, independent conditional: 0, independent unconditional: 9638, dependent: 175, dependent conditional: 20, dependent unconditional: 155, unknown: 8473, unknown conditional: 9, unknown unconditional: 8464] , Statistics on independence cache: Total cache size (in pairs): 8473, Positive cache size: 8423, Positive conditional cache size: 2, Positive unconditional cache size: 8421, Negative cache size: 50, Negative conditional cache size: 7, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 117, Maximal queried relation: 10, Independence queries for same thread: 807 - PositiveResult [Line: 1049]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 52 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 554.4s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 22.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 524, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 10.9s SatisfiabilityAnalysisTime, 63.2s InterpolantComputationTime, 11575 NumberOfCodeBlocks, 10510 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 15237 ConstructedInterpolants, 210 QuantifiedInterpolants, 122328 SizeOfPredicates, 187 NumberOfNonLiveVariables, 7850 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 65575/89507 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown