/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 02:45:36,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 02:45:36,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-08 02:45:36,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 02:45:36,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 02:45:36,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 02:45:36,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 02:45:36,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 02:45:36,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 02:45:36,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 02:45:36,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 02:45:36,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 02:45:36,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 02:45:36,858 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 02:45:36,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 02:45:36,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 02:45:36,859 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 02:45:36,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 02:45:36,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 02:45:36,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 02:45:36,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 02:45:36,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 02:45:36,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 02:45:36,860 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 02:45:36,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 02:45:36,861 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 02:45:36,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 02:45:36,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 02:45:36,862 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 02:45:36,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 02:45:36,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 02:45:36,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 02:45:36,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 02:45:36,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 02:45:36,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 02:45:36,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 02:45:36,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 02:45:36,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 02:45:36,864 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 02:45:36,864 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-08 02:45:36,865 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR [2023-09-08 02:45:37,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 02:45:37,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 02:45:37,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 02:45:37,100 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 02:45:37,100 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 02:45:37,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2023-09-08 02:45:38,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 02:45:38,543 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 02:45:38,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-09-08 02:45:38,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fab3725/f1a970d4181642839ff686737034147e/FLAG5cc37cb71 [2023-09-08 02:45:38,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fab3725/f1a970d4181642839ff686737034147e [2023-09-08 02:45:38,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 02:45:38,583 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 02:45:38,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 02:45:38,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 02:45:38,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 02:45:38,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:45:38" (1/1) ... [2023-09-08 02:45:38,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588bbe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:38, skipping insertion in model container [2023-09-08 02:45:38,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:45:38" (1/1) ... [2023-09-08 02:45:38,632 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 02:45:39,003 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_longer.i[43296,43309] [2023-09-08 02:45:39,011 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_longer.i[43503,43516] [2023-09-08 02:45:39,016 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_longer.i[43783,43796] [2023-09-08 02:45:39,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 02:45:39,034 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 02:45:39,056 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 02:45:39,059 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 02:45:39,065 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-08 02:45:39,086 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_longer.i[43296,43309] [2023-09-08 02:45:39,089 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_longer.i[43503,43516] [2023-09-08 02:45:39,096 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_longer.i[43783,43796] [2023-09-08 02:45:39,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 02:45:39,167 INFO L206 MainTranslator]: Completed translation [2023-09-08 02:45:39,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39 WrapperNode [2023-09-08 02:45:39,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 02:45:39,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 02:45:39,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 02:45:39,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 02:45:39,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,232 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-09-08 02:45:39,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 02:45:39,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 02:45:39,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 02:45:39,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 02:45:39,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 02:45:39,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 02:45:39,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 02:45:39,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 02:45:39,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (1/1) ... [2023-09-08 02:45:39,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 02:45:39,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:45:39,318 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-09-08 02:45:39,326 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-09-08 02:45:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-08 02:45:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-08 02:45:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-08 02:45:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-08 02:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 02:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 02:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 02:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 02:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-08 02:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 02:45:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 02:45:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 02:45:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 02:45:39,349 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 02:45:39,468 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 02:45:39,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 02:45:39,891 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 02:45:39,901 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 02:45:39,901 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 02:45:39,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:45:39 BoogieIcfgContainer [2023-09-08 02:45:39,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 02:45:39,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 02:45:39,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 02:45:39,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 02:45:39,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:45:38" (1/3) ... [2023-09-08 02:45:39,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d3336a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:45:39, skipping insertion in model container [2023-09-08 02:45:39,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:45:39" (2/3) ... [2023-09-08 02:45:39,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d3336a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:45:39, skipping insertion in model container [2023-09-08 02:45:39,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:45:39" (3/3) ... [2023-09-08 02:45:39,910 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-09-08 02:45:39,921 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 02:45:39,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 02:45:39,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-09-08 02:45:39,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 02:45:40,017 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 02:45:40,059 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 02:45:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 02:45:40,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:45:40,066 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-09-08 02:45:40,068 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-09-08 02:45:40,096 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 02:45:40,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 02:45:40,108 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=LoopsAndPotentialCycles, 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;@34892d8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 02:45:40,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-08 02:45:40,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:40,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-09-08 02:45:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:40,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369347049] [2023-09-08 02:45:40,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:45:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:45:40,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:45:40,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369347049] [2023-09-08 02:45:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369347049] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:45:40,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:45:40,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 02:45:40,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610670072] [2023-09-08 02:45:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:45:40,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 02:45:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:45:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 02:45:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 02:45:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:45:40,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-09-08 02:45:40,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 02:45:40,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:40,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507384, now seen corresponding path program 1 times [2023-09-08 02:45:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:40,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415226150] [2023-09-08 02:45:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:45:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:45:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:45:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415226150] [2023-09-08 02:45:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415226150] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:45:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:45:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 02:45:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932439043] [2023-09-08 02:45:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:45:40,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 02:45:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:45:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 02:45:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 02:45:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,724 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:45:40,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-09-08 02:45:40,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 02:45:40,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:40,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236260, now seen corresponding path program 1 times [2023-09-08 02:45:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939316248] [2023-09-08 02:45:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:45:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:45:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:45:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939316248] [2023-09-08 02:45:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939316248] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:45:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:45:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-09-08 02:45:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857991778] [2023-09-08 02:45:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:45:43,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-08 02:45:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:45:43,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-08 02:45:43,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-08 02:45:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:43,197 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:45:43,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 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-09-08 02:45:43,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:43,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:43,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:44,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 02:45:44,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:44,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 934072322, now seen corresponding path program 1 times [2023-09-08 02:45:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608804173] [2023-09-08 02:45:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:45:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:45:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:45:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608804173] [2023-09-08 02:45:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608804173] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:45:53,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:45:53,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-09-08 02:45:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783746104] [2023-09-08 02:45:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:45:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-08 02:45:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:45:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-08 02:45:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2023-09-08 02:45:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:53,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:45:53,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 30 states have internal predecessors, (115), 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-09-08 02:45:53,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:53,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:53,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:53,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:56,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-08 02:45:56,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-08 02:45:56,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:56,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1713858353, now seen corresponding path program 1 times [2023-09-08 02:45:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:56,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936094062] [2023-09-08 02:45:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:56,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:45:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:45:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:45:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936094062] [2023-09-08 02:45:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936094062] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:45:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:45:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 02:45:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132098293] [2023-09-08 02:45:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:45:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 02:45:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:45:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 02:45:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 02:45:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:56,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:45:56,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-09-08 02:45:56,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:56,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:56,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:56,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-09-08 02:45:56,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:45:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:56,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-08 02:45:56,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:56,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1493771274, now seen corresponding path program 1 times [2023-09-08 02:45:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:56,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398126101] [2023-09-08 02:45:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:56,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:45:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-09-08 02:45:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:45:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398126101] [2023-09-08 02:45:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398126101] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:45:57,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:45:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 02:45:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453552621] [2023-09-08 02:45:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:45:57,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 02:45:57,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:45:57,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 02:45:57,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 02:45:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:57,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:45:57,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 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-09-08 02:45:57,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:57,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:57,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:57,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:45:57,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:57,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:45:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:45:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:45:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:45:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:45:57,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-08 02:45:57,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:45:57,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:45:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 494892714, now seen corresponding path program 2 times [2023-09-08 02:45:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:45:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074500458] [2023-09-08 02:45:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:45:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:45:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:46:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:46:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:46:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074500458] [2023-09-08 02:46:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074500458] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:46:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530849867] [2023-09-08 02:46:02,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 02:46:02,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:46:02,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:46:02,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:46:02,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-08 02:46:02,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 02:46:02,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:46:02,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 118 conjunts are in the unsatisfiable core [2023-09-08 02:46:02,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:46:03,115 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-09-08 02:46:03,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-09-08 02:46:03,263 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-09-08 02:46:03,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2023-09-08 02:46:03,812 INFO L351 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-09-08 02:46:03,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-09-08 02:46:05,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-08 02:46:05,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-08 02:46:05,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:46:05,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:46:05,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-09-08 02:46:05,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-08 02:46:06,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-09-08 02:46:06,321 INFO L351 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 21 treesize of output 21 [2023-09-08 02:46:06,921 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-08 02:46:06,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-09-08 02:46:06,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-08 02:46:07,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-09-08 02:46:07,153 INFO L351 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 14 treesize of output 16 [2023-09-08 02:46:07,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-08 02:46:07,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 02:46:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:46:07,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:46:07,849 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2023-09-08 02:46:09,267 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_304))))) is different from false [2023-09-08 02:46:09,433 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_304)))))) is different from false [2023-09-08 02:46:09,515 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_302) .cse3 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_304) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))))))) is different from false [2023-09-08 02:46:09,592 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_300 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_300)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_302) .cse4 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_304)))))) is different from false [2023-09-08 02:46:09,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (forall ((v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_300 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_300))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_302) .cse1 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_309) .cse4 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_304))))))))) is different from false [2023-09-08 02:46:09,666 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_300 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_300)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_302) .cse4 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_304))))))) is different from false [2023-09-08 02:46:18,688 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_300 Int) (v_ArrVal_306 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_299))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_300)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_302) .cse1 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) .cse3 v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_304)))))))) is different from false [2023-09-08 02:46:18,813 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_309 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_307 Int) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_300 Int) (v_ArrVal_306 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_299))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_300)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_302) .cse1 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_304) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) .cse5 v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))))))))) is different from false [2023-09-08 02:46:19,971 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_309 Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_307 Int) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_304 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_302 Int) (v_ArrVal_312 Int) (v_ArrVal_300 Int) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_296 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_296)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_299))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_300)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_302) .cse1 v_ArrVal_304)) |c_~#stored_elements~0.base| v_ArrVal_306))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_304) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (not (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4)))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_307) .cse8 v_ArrVal_309) .cse1 v_ArrVal_312)) |c_~#stored_elements~0.base| v_ArrVal_313) |c_~#queue~0.base|) .cse4))))))))))) is different from false [2023-09-08 02:46:20,053 INFO L322 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-09-08 02:46:20,054 INFO L351 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 5 case distinctions, treesize of input 1077 treesize of output 945 [2023-09-08 02:46:20,115 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:46:20,115 INFO L351 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 1574 treesize of output 1558 [2023-09-08 02:46:20,152 INFO L351 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 230 treesize of output 214 [2023-09-08 02:46:20,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 309 [2023-09-08 02:46:20,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 479 treesize of output 447 [2023-09-08 02:46:20,247 INFO L351 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 126 treesize of output 110 [2023-09-08 02:46:20,557 INFO L351 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-09-08 02:46:20,704 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:46:20,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 212 [2023-09-08 02:46:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:46:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530849867] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:46:22,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:46:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40, 38] total 118 [2023-09-08 02:46:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888429697] [2023-09-08 02:46:22,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:46:22,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2023-09-08 02:46:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:46:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2023-09-08 02:46:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=10810, Unknown=47, NotChecked=2210, Total=13806 [2023-09-08 02:46:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:22,178 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:46:22,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 4.483050847457627) internal successors, (529), 118 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-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:22,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:44,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 02:46:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:46:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:46:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-09-08 02:46:46,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-08 02:46:46,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-09-08 02:46:46,552 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:46:46,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:46:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1636952901, now seen corresponding path program 1 times [2023-09-08 02:46:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:46:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804568101] [2023-09-08 02:46:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:46:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:46:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:46:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-09-08 02:46:46,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:46:46,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804568101] [2023-09-08 02:46:46,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804568101] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:46:46,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:46:46,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 02:46:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442070603] [2023-09-08 02:46:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:46:46,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 02:46:46,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:46:46,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 02:46:46,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 02:46:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:46,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:46:46,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-09-08 02:46:46,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-09-08 02:46:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:51,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-08 02:46:51,256 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:46:51,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:46:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1973813566, now seen corresponding path program 1 times [2023-09-08 02:46:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:46:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932283936] [2023-09-08 02:46:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:46:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:46:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:46:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-08 02:46:53,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:46:53,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932283936] [2023-09-08 02:46:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932283936] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:46:53,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:46:53,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-09-08 02:46:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072180195] [2023-09-08 02:46:53,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:46:53,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-08 02:46:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:46:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-08 02:46:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2023-09-08 02:46:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:53,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:46:53,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 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-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:46:53,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:47:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:47:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-08 02:47:00,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-08 02:47:00,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 02:47:00,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:47:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1521214599, now seen corresponding path program 1 times [2023-09-08 02:47:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:47:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763059686] [2023-09-08 02:47:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:47:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:47:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:47:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:47:06,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:47:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763059686] [2023-09-08 02:47:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763059686] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:47:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268871475] [2023-09-08 02:47:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:47:06,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:47:06,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:47:06,320 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-09-08 02:47:06,321 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-09-08 02:47:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:47:06,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 123 conjunts are in the unsatisfiable core [2023-09-08 02:47:06,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:47:06,671 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 02:47:06,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 02:47:06,742 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-08 02:47:06,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-08 02:47:06,974 INFO L351 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-09-08 02:47:07,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-09-08 02:47:07,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-08 02:47:07,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-08 02:47:07,797 INFO L351 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 21 treesize of output 21 [2023-09-08 02:47:08,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-08 02:47:08,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-09-08 02:47:08,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-09-08 02:47:09,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:09,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-09-08 02:47:10,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:10,151 INFO L322 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-09-08 02:47:10,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-09-08 02:47:10,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:10,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2023-09-08 02:47:10,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:10,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-09-08 02:47:10,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:10,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:10,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2023-09-08 02:47:11,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:11,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-09-08 02:47:11,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-09-08 02:47:11,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:47:11,755 INFO L351 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 14 treesize of output 16 [2023-09-08 02:47:11,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 02:47:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-08 02:47:12,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:49:04,270 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse21 (+ (* (select .cse21 .cse13) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse5 (+ (select .cse11 .cse13) 1)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse7 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_568) .cse13 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_574)))) (let ((.cse2 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_576) .cse4 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (= 400 (select .cse3 .cse4)) (< v_ArrVal_570 .cse5) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))))))) (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_568) .cse13 v_ArrVal_570)))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse15 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_574)))) (let ((.cse14 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_576) .cse4 v_ArrVal_577)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (= 400 (select .cse15 .cse4)) (< v_ArrVal_570 .cse5) (= (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (select .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|))) 0)))))))))) is different from false [2023-09-08 02:49:20,391 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse11 (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse21 (+ (* (select .cse21 .cse13) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse3 (+ (select .cse11 .cse13) 1)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse12 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse7 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse11 .cse12 v_ArrVal_568) .cse13 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)) v_ArrVal_574)))) (let ((.cse2 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_576) .cse5 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (< v_ArrVal_570 .cse3) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (= 400 (select .cse4 .cse5)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))))))) (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse11 .cse12 v_ArrVal_568) .cse13 v_ArrVal_570)))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse16 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse5) 4)) v_ArrVal_574)))) (let ((.cse14 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_576) .cse5 v_ArrVal_577)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (< v_ArrVal_570 .cse3) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) 0) (= 400 (select .cse16 .cse5))))))))))) is different from false [2023-09-08 02:49:21,768 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse5 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse7 (let ((.cse10 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_568) .cse1 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse0 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_574)))) (let ((.cse2 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_576) .cse1 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (= 400 (select .cse0 .cse1)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)) (not (= (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (select .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|))) 0)) (< v_ArrVal_570 (+ (select .cse5 .cse1) 1)))))))) (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse16 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_568) .cse1 v_ArrVal_570)))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse13 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_574)))) (let ((.cse14 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_576) .cse1 v_ArrVal_577)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (= 400 (select .cse13 .cse1)) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ (* 4 (select .cse15 .cse4)) |c_~#queue~0.offset|))) 0) (< v_ArrVal_570 (+ (select .cse16 .cse1) 1))))))))))) is different from false [2023-09-08 02:49:24,440 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse5 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_568) .cse2 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse2))) v_ArrVal_574)))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse8 v_ArrVal_576) .cse2 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (= (select .cse1 .cse2) 400) (= (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0) (< v_ArrVal_570 (+ (select .cse5 .cse2) 1))))))))) (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse16 (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (let ((.cse20 (store .cse21 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_568) .cse2 v_ArrVal_570)))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse15 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* 4 (select .cse19 .cse2))) v_ArrVal_574)))) (let ((.cse13 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_576) .cse2 v_ArrVal_577)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)) (not (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (= (select .cse15 .cse2) 400) (< v_ArrVal_570 (+ (select .cse16 .cse2) 1))))))))))) is different from false [2023-09-08 02:49:25,669 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse3 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_568) .cse4 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse4))) v_ArrVal_574)))) (let ((.cse2 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_576) .cse4 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (< v_ArrVal_570 (+ (select .cse3 .cse4) 1)) (= 400 (select .cse5 .cse4)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))))))))) (forall ((v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int)) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse15 (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse4) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse18 (let ((.cse20 (store .cse21 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_568) .cse4 v_ArrVal_570)))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse16 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* 4 (select .cse19 .cse4))) v_ArrVal_574)))) (let ((.cse14 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_576) .cse4 v_ArrVal_577)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (= (let ((.cse13 (select .cse14 |c_~#queue~0.base|))) (select .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|))) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (< v_ArrVal_570 (+ (select .cse15 .cse4) 1)) (= 400 (select .cse16 .cse4)) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))))))))) is different from false [2023-09-08 02:49:30,042 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse14 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int) (v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_562 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int)) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse13 .cse14 v_ArrVal_562)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse5 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_568) .cse1 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse0 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_574)))) (let ((.cse2 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_576) .cse1 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (= 400 (select .cse0 .cse1)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (not (= (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0)) (< v_ArrVal_570 (+ (select .cse5 .cse1) 1))))))))) (forall ((|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int) (v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_562 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int)) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse13 .cse14 v_ArrVal_562)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse18 (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse20 (let ((.cse22 (store .cse23 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_568) .cse1 v_ArrVal_570)))) (store .cse22 |c_~#stored_elements~0.base| (store (select .cse22 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse17 (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_574)))) (let ((.cse16 (let ((.cse19 (store .cse20 |c_~#queue~0.base| (store (store .cse17 .cse8 v_ArrVal_576) .cse1 v_ArrVal_577)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (= (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|))) 0) (= 400 (select .cse17 .cse1)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< v_ArrVal_570 (+ (select .cse18 .cse1) 1))))))))))) is different from false [2023-09-08 02:49:30,785 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0)) (.cse14 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int) (v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_562 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int)) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse13 .cse14 v_ArrVal_562)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_568) .cse1 v_ArrVal_570)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_574)))) (let ((.cse2 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_576) .cse1 v_ArrVal_577)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (< v_ArrVal_570 (+ (select .cse0 .cse1) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)) (= 400 (select .cse3 .cse1)) (not (= (let ((.cse4 (select .cse2 |c_~#queue~0.base|))) (select .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)))) 0))))))))) (forall ((|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_579 Int) (v_ArrVal_577 Int) (v_ArrVal_576 Int) (v_ArrVal_574 Int) (v_ArrVal_562 Int) (v_ArrVal_570 Int) (|v_t1Thread1of1ForFork0_~i~0#1_22| Int)) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse13 .cse14 v_ArrVal_562)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse17 (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse20 (let ((.cse22 (store .cse23 |c_~#queue~0.base| (store (store .cse17 .cse8 v_ArrVal_568) .cse1 v_ArrVal_570)))) (store .cse22 |c_~#stored_elements~0.base| (store (select .cse22 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse18 (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)) v_ArrVal_574)))) (let ((.cse16 (let ((.cse19 (store .cse20 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_576) .cse1 v_ArrVal_577)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_22| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_579))))) (or (= (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (select .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse5) 4)))) 0) (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_582) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< v_ArrVal_570 (+ (select .cse17 .cse1) 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_22| 0) (= 400 (select .cse18 .cse1))))))))))) is different from false [2023-09-08 02:49:30,987 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:49:30,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 4735 treesize of output 2325 [2023-09-08 02:49:31,521 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:49:31,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133083 treesize of output 130047 [2023-09-08 02:49:31,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 02:49:41,975 WARN L234 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-09-08 02:49:41,975 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:49:42,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 557613061116893 treesize of output 508659022276633 Received shutdown request... [2023-09-08 02:59:31,889 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-09-08 02:59:31,897 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-09-08 02:59:31,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 02:59:32,060 WARN L266 SmtUtils]: Removed 1 from assertion stack [2023-09-08 02:59:32,062 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-08 02:59:32,069 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-09-08 02:59:32,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:59:32,269 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 200 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-27-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-100-4-3-4-4-4-4-4-3-5-3-5-3-5-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 context. [2023-09-08 02:59:32,270 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-08 02:59:32,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-08 02:59:32,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-08 02:59:32,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-09-08 02:59:32,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-09-08 02:59:32,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-08 02:59:32,274 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 02:59:32,278 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 02:59:32,279 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 02:59:32,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:59:32 BasicIcfg [2023-09-08 02:59:32,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 02:59:32,281 INFO L158 Benchmark]: Toolchain (without parser) took 833698.02ms. Allocated memory was 263.2MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 205.4MB in the beginning and 806.5MB in the end (delta: -601.1MB). Peak memory consumption was 716.3MB. Max. memory is 7.0GB. [2023-09-08 02:59:32,281 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 160.4MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 02:59:32,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.37ms. Allocated memory is still 263.2MB. Free memory was 205.2MB in the beginning and 174.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-08 02:59:32,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.27ms. Allocated memory is still 263.2MB. Free memory was 174.8MB in the beginning and 171.9MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-08 02:59:32,284 INFO L158 Benchmark]: Boogie Preprocessor took 51.46ms. Allocated memory is still 263.2MB. Free memory was 171.6MB in the beginning and 169.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 02:59:32,284 INFO L158 Benchmark]: RCFGBuilder took 617.94ms. Allocated memory is still 263.2MB. Free memory was 169.5MB in the beginning and 217.9MB in the end (delta: -48.4MB). Peak memory consumption was 19.3MB. Max. memory is 7.0GB. [2023-09-08 02:59:32,284 INFO L158 Benchmark]: TraceAbstraction took 832375.85ms. Allocated memory was 263.2MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 217.4MB in the beginning and 806.5MB in the end (delta: -589.2MB). Peak memory consumption was 727.5MB. Max. memory is 7.0GB. [2023-09-08 02:59:32,286 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 160.4MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 583.37ms. Allocated memory is still 263.2MB. Free memory was 205.2MB in the beginning and 174.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 63.27ms. Allocated memory is still 263.2MB. Free memory was 174.8MB in the beginning and 171.9MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 51.46ms. Allocated memory is still 263.2MB. Free memory was 171.6MB in the beginning and 169.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 617.94ms. Allocated memory is still 263.2MB. Free memory was 169.5MB in the beginning and 217.9MB in the end (delta: -48.4MB). Peak memory consumption was 19.3MB. Max. memory is 7.0GB. * TraceAbstraction took 832375.85ms. Allocated memory was 263.2MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 217.4MB in the beginning and 806.5MB in the end (delta: -589.2MB). Peak memory consumption was 727.5MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1585, independent: 1430, independent conditional: 1430, independent unconditional: 0, dependent: 155, dependent conditional: 155, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1436, independent: 1430, independent conditional: 1430, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1436, independent: 1430, independent conditional: 1430, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1466, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 36, dependent conditional: 30, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1466, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 36, dependent conditional: 1, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1466, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 36, dependent conditional: 1, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 394, independent: 387, independent conditional: 0, independent unconditional: 387, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 394, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 44, dependent conditional: 7, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1466, independent: 1043, independent conditional: 0, independent unconditional: 1043, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 394, unknown conditional: 1, unknown unconditional: 393] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 387, Positive conditional cache size: 0, Positive unconditional cache size: 387, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 5, Independence queries for same thread: 149 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 200 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-27-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-100-4-3-4-4-4-4-4-3-5-3-5-3-5-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 200 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-27-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-100-4-3-4-4-4-4-4-3-5-3-5-3-5-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 200 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-27-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-100-4-3-4-4-4-4-4-3-5-3-5-3-5-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 200 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-27-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-100-4-3-4-4-4-4-4-3-5-3-5-3-5-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 200 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-27-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-100-4-3-4-4-4-4-4-3-5-3-5-3-5-3-4-3-4-3-4-3-4-3-4-3-4-3-4-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 832.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 39.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1794 ConstructedInterpolants, 123 QuantifiedInterpolants, 38139 SizeOfPredicates, 40 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 364/367 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