/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-9d61ce8-m [2023-09-06 16:56:50,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-06 16:56:50,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-06 16:56:50,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-06 16:56:50,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-06 16:56:50,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-06 16:56:50,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-06 16:56:50,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-06 16:56:50,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-06 16:56:50,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-06 16:56:50,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-06 16:56:50,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-06 16:56:50,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-06 16:56:50,187 INFO L153 SettingsManager]: * Use SBE=true [2023-09-06 16:56:50,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-06 16:56:50,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-06 16:56:50,188 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-06 16:56:50,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-06 16:56:50,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-06 16:56:50,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-06 16:56:50,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-06 16:56:50,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-06 16:56:50,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-06 16:56:50,196 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-06 16:56:50,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-06 16:56:50,197 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-06 16:56:50,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-06 16:56:50,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-06 16:56:50,197 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-06 16:56:50,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-06 16:56:50,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-06 16:56:50,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-06 16:56:50,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-06 16:56:50,199 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-06 16:56:50,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-06 16:56:50,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-06 16:56:50,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-06 16:56:50,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-06 16:56:50,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-06 16:56:50,200 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-06 16:56:50,200 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-06 16:56:50,200 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 [2023-09-06 16:56:50,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-06 16:56:50,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-06 16:56:50,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-06 16:56:50,393 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-06 16:56:50,393 INFO L274 PluginConnector]: CDTParser initialized [2023-09-06 16:56:50,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-09-06 16:56:51,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-06 16:56:51,786 INFO L384 CDTParser]: Found 1 translation units. [2023-09-06 16:56:51,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-09-06 16:56:51,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a836cd8/4b2caa53515f4aac940398bbe907d7e7/FLAGc72e59976 [2023-09-06 16:56:51,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a836cd8/4b2caa53515f4aac940398bbe907d7e7 [2023-09-06 16:56:51,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-06 16:56:51,833 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-06 16:56:51,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-06 16:56:51,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-06 16:56:51,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-06 16:56:51,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.09 04:56:51" (1/1) ... [2023-09-06 16:56:51,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc2a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:51, skipping insertion in model container [2023-09-06 16:56:51,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.09 04:56:51" (1/1) ... [2023-09-06 16:56:51,893 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-06 16:56:52,312 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-09-06 16:56:52,319 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-09-06 16:56:52,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-06 16:56:52,335 INFO L202 MainTranslator]: Completed pre-run [2023-09-06 16:56:52,358 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-06 16:56:52,359 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-06 16:56:52,378 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-06 16:56:52,394 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-09-06 16:56:52,404 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-09-06 16:56:52,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-06 16:56:52,451 INFO L206 MainTranslator]: Completed translation [2023-09-06 16:56:52,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52 WrapperNode [2023-09-06 16:56:52,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-06 16:56:52,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-06 16:56:52,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-06 16:56:52,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-06 16:56:52,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,531 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-09-06 16:56:52,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-06 16:56:52,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-06 16:56:52,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-06 16:56:52,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-06 16:56:52,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-06 16:56:52,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-06 16:56:52,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-06 16:56:52,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-06 16:56:52,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (1/1) ... [2023-09-06 16:56:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-06 16:56:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:56:52,650 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-06 16:56:52,664 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-06 16:56:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-06 16:56:52,689 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-06 16:56:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-06 16:56:52,690 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-06 16:56:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-06 16:56:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-06 16:56:52,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-06 16:56:52,692 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-06 16:56:52,867 INFO L236 CfgBuilder]: Building ICFG [2023-09-06 16:56:52,869 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-06 16:56:53,154 INFO L277 CfgBuilder]: Performing block encoding [2023-09-06 16:56:53,161 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-06 16:56:53,162 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-06 16:56:53,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.09 04:56:53 BoogieIcfgContainer [2023-09-06 16:56:53,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-06 16:56:53,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-06 16:56:53,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-06 16:56:53,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-06 16:56:53,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.09 04:56:51" (1/3) ... [2023-09-06 16:56:53,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505c3901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.09 04:56:53, skipping insertion in model container [2023-09-06 16:56:53,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.09 04:56:52" (2/3) ... [2023-09-06 16:56:53,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505c3901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.09 04:56:53, skipping insertion in model container [2023-09-06 16:56:53,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.09 04:56:53" (3/3) ... [2023-09-06 16:56:53,171 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-09-06 16:56:53,177 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-06 16:56:53,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-06 16:56:53,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-06 16:56:53,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-06 16:56:53,269 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-06 16:56:53,329 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-06 16:56:53,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-06 16:56:53,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:56:53,332 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-06 16:56:53,335 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-06 16:56:53,367 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-06 16:56:53,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-06 16:56:53,379 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;@5e93838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-06 16:56:53,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-06 16:56:53,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:53,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-09-06 16:56:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:53,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306034015] [2023-09-06 16:56:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:53,700 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-06 16:56:53,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:56:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306034015] [2023-09-06 16:56:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306034015] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:56:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 16:56:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-06 16:56:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176986223] [2023-09-06 16:56:53,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:56:53,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-06 16:56:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:56:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-06 16:56:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-06 16:56:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:53,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:56:53,727 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-06 16:56:53,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-06 16:56:53,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:53,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash -446658237, now seen corresponding path program 1 times [2023-09-06 16:56:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688194915] [2023-09-06 16:56:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:54,102 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-06 16:56:54,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:56:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688194915] [2023-09-06 16:56:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688194915] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:56:54,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 16:56:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-06 16:56:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319678297] [2023-09-06 16:56:54,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:56:54,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-06 16:56:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:56:54,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-06 16:56:54,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-06 16:56:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:54,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:56:54,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-06 16:56:54,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:54,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:56:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:54,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-06 16:56:54,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:54,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1277973936, now seen corresponding path program 1 times [2023-09-06 16:56:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159341286] [2023-09-06 16:56:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:54,616 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-06 16:56:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:56:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159341286] [2023-09-06 16:56:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159341286] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:56:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253329998] [2023-09-06 16:56:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:54,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:56:54,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:56:54,655 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-06 16:56:54,656 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-06 16:56:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:54,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-06 16:56:54,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:56:54,944 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-06 16:56:54,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:56:55,024 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-06 16:56:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253329998] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:56:55,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:56:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-06 16:56:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513211683] [2023-09-06 16:56:55,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:56:55,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-06 16:56:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:56:55,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-06 16:56:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-06 16:56:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:55,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:56:55,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-06 16:56:55,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:55,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:55,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:56:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:55,301 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-06 16:56:55,498 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,SelfDestructingSolverStorable2 [2023-09-06 16:56:55,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:55,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1525400594, now seen corresponding path program 2 times [2023-09-06 16:56:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973440077] [2023-09-06 16:56:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-09-06 16:56:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:56:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973440077] [2023-09-06 16:56:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973440077] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:56:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-06 16:56:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-06 16:56:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771465865] [2023-09-06 16:56:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:56:55,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-06 16:56:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:56:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-06 16:56:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-06 16:56:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:55,817 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:56:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-06 16:56:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:55,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:56:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:56,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-06 16:56:56,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:56,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 525238176, now seen corresponding path program 1 times [2023-09-06 16:56:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896829584] [2023-09-06 16:56:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:56:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:56:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896829584] [2023-09-06 16:56:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896829584] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:56:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868785406] [2023-09-06 16:56:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:56,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:56:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:56:56,536 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-06 16:56:56,538 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-06 16:56:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:56,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-06 16:56:56,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:56:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:56:56,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:56:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:56:57,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868785406] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:56:57,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:56:57,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-09-06 16:56:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066556963] [2023-09-06 16:56:57,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:56:57,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-09-06 16:56:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:56:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-09-06 16:56:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-09-06 16:56:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:57,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:56:57,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 17.954545454545453) internal successors, (395), 22 states have internal predecessors, (395), 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-06 16:56:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:57,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:57,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:57,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:57,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:56:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:56:57,734 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-06 16:56:57,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:56:57,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:57,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash 978689628, now seen corresponding path program 2 times [2023-09-06 16:56:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151752495] [2023-09-06 16:56:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:56:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:56:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:56:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151752495] [2023-09-06 16:56:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151752495] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:56:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991371060] [2023-09-06 16:56:59,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-06 16:56:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:56:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:56:59,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:56:59,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-06 16:56:59,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-06 16:56:59,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-06 16:56:59,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-06 16:56:59,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:56:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1360 trivial. 0 not checked. [2023-09-06 16:56:59,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-06 16:56:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991371060] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:56:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-06 16:56:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [23] total 25 [2023-09-06 16:56:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453992316] [2023-09-06 16:56:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:56:59,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-06 16:56:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:56:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-06 16:56:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-09-06 16:56:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:59,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:56:59,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-06 16:56:59,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:59,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:59,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:59,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:59,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:56:59,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:56:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:56:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:56:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:56:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:56:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:56:59,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-06 16:56:59,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:56:59,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:56:59,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:56:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1290472203, now seen corresponding path program 1 times [2023-09-06 16:56:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:56:59,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740749413] [2023-09-06 16:56:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:56:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:56:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740749413] [2023-09-06 16:57:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740749413] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:57:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333745370] [2023-09-06 16:57:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:00,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:00,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:00,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:57:00,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-06 16:57:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:01,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 22 conjunts are in the unsatisfiable core [2023-09-06 16:57:01,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:57:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:01,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:57:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:02,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333745370] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:57:02,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:57:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 43 [2023-09-06 16:57:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772050742] [2023-09-06 16:57:02,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:57:02,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-06 16:57:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:02,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-06 16:57:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-09-06 16:57:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:02,380 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:02,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.837209302325583) internal successors, (724), 43 states have internal predecessors, (724), 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-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:02,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:57:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:03,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-06 16:57:04,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:04,178 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:57:04,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1666013731, now seen corresponding path program 2 times [2023-09-06 16:57:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632347959] [2023-09-06 16:57:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6321 backedges. 5769 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:06,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632347959] [2023-09-06 16:57:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632347959] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:57:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657528619] [2023-09-06 16:57:06,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-06 16:57:06,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:06,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:57:06,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-06 16:57:07,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-06 16:57:07,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-06 16:57:07,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 42 conjunts are in the unsatisfiable core [2023-09-06 16:57:07,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:57:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6321 backedges. 6321 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-06 16:57:08,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-06 16:57:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657528619] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-06 16:57:08,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-06 16:57:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-09-06 16:57:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743013147] [2023-09-06 16:57:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-06 16:57:08,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-06 16:57:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-06 16:57:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-09-06 16:57:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:08,056 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:08,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 17.488372093023255) internal successors, (752), 43 states have internal predecessors, (752), 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-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:08,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:09,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-06 16:57:09,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:09,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:57:09,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1321391507, now seen corresponding path program 1 times [2023-09-06 16:57:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70284256] [2023-09-06 16:57:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5731 backedges. 1400 proven. 37 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2023-09-06 16:57:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70284256] [2023-09-06 16:57:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70284256] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:57:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610213122] [2023-09-06 16:57:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:15,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:15,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:57:15,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-06 16:57:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:15,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 32 conjunts are in the unsatisfiable core [2023-09-06 16:57:15,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:57:17,075 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-06 16:57:17,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:17,138 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-06 16:57:17,291 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-06 16:57:17,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-09-06 16:57:17,319 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-06 16:57:17,333 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-06 16:57:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5731 backedges. 3096 proven. 181 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2023-09-06 16:57:17,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:57:17,575 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1485 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1485) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2023-09-06 16:57:17,594 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:57:17,594 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-09-06 16:57:17,603 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:57:17,603 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 35 treesize of output 34 [2023-09-06 16:57:17,631 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 7 treesize of output 3 [2023-09-06 16:57:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5731 backedges. 3061 proven. 181 refuted. 0 times theorem prover too weak. 2454 trivial. 35 not checked. [2023-09-06 16:57:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610213122] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:57:18,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:57:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 38 [2023-09-06 16:57:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231960003] [2023-09-06 16:57:18,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:57:18,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-09-06 16:57:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-09-06 16:57:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1169, Unknown=1, NotChecked=70, Total=1406 [2023-09-06 16:57:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:18,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:18,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 12.842105263157896) internal successors, (488), 38 states have internal predecessors, (488), 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-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:18,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:57:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:57:19,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-06 16:57:19,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:19,620 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:57:19,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1818231711, now seen corresponding path program 1 times [2023-09-06 16:57:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645857935] [2023-09-06 16:57:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5711 backedges. 171 proven. 3051 refuted. 0 times theorem prover too weak. 2489 trivial. 0 not checked. [2023-09-06 16:57:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645857935] [2023-09-06 16:57:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645857935] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:57:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644995745] [2023-09-06 16:57:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:28,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:57:28,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-06 16:57:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:29,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 1650 conjuncts, 35 conjunts are in the unsatisfiable core [2023-09-06 16:57:29,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:57:31,403 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 26 treesize of output 10 [2023-09-06 16:57:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5711 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 5643 trivial. 0 not checked. [2023-09-06 16:57:31,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:57:31,637 INFO L322 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2023-09-06 16:57:31,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 41 [2023-09-06 16:57:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5711 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2023-09-06 16:57:31,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644995745] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:57:31,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:57:31,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 11] total 45 [2023-09-06 16:57:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913015154] [2023-09-06 16:57:31,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:57:31,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-09-06 16:57:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-09-06 16:57:31,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1724, Unknown=0, NotChecked=0, Total=1980 [2023-09-06 16:57:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:31,732 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:31,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 11.2) internal successors, (504), 45 states have internal predecessors, (504), 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-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:57:31,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:57:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:57:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-06 16:57:33,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-06 16:57:33,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-09-06 16:57:33,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:57:33,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1231800167, now seen corresponding path program 1 times [2023-09-06 16:57:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:33,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55163250] [2023-09-06 16:57:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 1409 proven. 42 refuted. 0 times theorem prover too weak. 4249 trivial. 0 not checked. [2023-09-06 16:57:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55163250] [2023-09-06 16:57:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55163250] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:57:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857330902] [2023-09-06 16:57:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:37,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:37,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:37,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:57:37,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-06 16:57:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:38,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 82 conjunts are in the unsatisfiable core [2023-09-06 16:57:38,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:57:38,970 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-06 16:57:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:39,019 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-06 16:57:39,199 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-06 16:57:39,242 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-06 16:57:39,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-06 16:57:39,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:39,457 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-06 16:57:39,665 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-06 16:57:39,707 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-06 16:57:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2332 proven. 29 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2023-09-06 16:57:39,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:57:40,077 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-06 16:57:40,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-06 16:57:40,092 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2251 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1))))) is different from false [2023-09-06 16:57:40,121 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-06 16:57:40,148 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2245 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (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_2245)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-06 16:57:40,158 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2245 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2245)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-06 16:57:40,174 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2245 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2245)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-06 16:57:40,646 INFO L322 Elim1Store]: treesize reduction 335, result has 45.1 percent of original size [2023-09-06 16:57:40,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 457 treesize of output 530 [2023-09-06 16:57:40,731 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-06 16:57:40,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 407 treesize of output 630 [2023-09-06 16:57:40,757 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 111 treesize of output 87 [2023-09-06 16:57:41,528 INFO L322 Elim1Store]: treesize reduction 131, result has 33.8 percent of original size [2023-09-06 16:57:41,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 576 treesize of output 2454 [2023-09-06 16:57:42,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 49 treesize of output 33 [2023-09-06 16:57:42,217 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-06 16:57:42,472 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-06 16:57:42,523 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:57:42,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 117 [2023-09-06 16:57:43,093 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:57:43,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2023-09-06 16:57:43,430 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:57:43,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 394 treesize of output 395 [2023-09-06 16:57:44,122 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-06 16:57:44,122 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 391 treesize of output 343 [2023-09-06 16:57:44,135 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 113 treesize of output 109 [2023-09-06 16:57:44,180 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:57:44,180 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 93 treesize of output 83 [2023-09-06 16:57:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2221 proven. 75 refuted. 5 times theorem prover too weak. 3339 trivial. 60 not checked. [2023-09-06 16:57:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857330902] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:57:44,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:57:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 21] total 53 [2023-09-06 16:57:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358073325] [2023-09-06 16:57:44,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:57:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-09-06 16:57:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:57:44,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-09-06 16:57:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1693, Unknown=12, NotChecked=658, Total=2756 [2023-09-06 16:57:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:44,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:57:44,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 11.056603773584905) internal successors, (586), 53 states have internal predecessors, (586), 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-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-06 16:57:44,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:57:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-06 16:57:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-06 16:57:47,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-06 16:57:47,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:47,353 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:57:47,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:57:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -590754094, now seen corresponding path program 2 times [2023-09-06 16:57:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:57:47,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220614101] [2023-09-06 16:57:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:57:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:57:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:57:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3719 proven. 200 refuted. 0 times theorem prover too weak. 2071 trivial. 0 not checked. [2023-09-06 16:57:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:57:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220614101] [2023-09-06 16:57:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220614101] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:57:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899092192] [2023-09-06 16:57:54,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-06 16:57:54,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:57:54,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:57:54,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:57:54,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-06 16:57:54,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-06 16:57:54,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-06 16:57:54,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 130 conjunts are in the unsatisfiable core [2023-09-06 16:57:54,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-06 16:57:56,086 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-06 16:57:56,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:56,139 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-06 16:57:56,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:56,354 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 20 [2023-09-06 16:57:56,417 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-06 16:57:56,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-06 16:57:56,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:56,643 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-06 16:57:56,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:56,886 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 20 [2023-09-06 16:57:56,926 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-06 16:57:57,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-06 16:57:57,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:57,160 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-06 16:57:57,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:57,354 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 20 [2023-09-06 16:57:57,392 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-06 16:57:57,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-06 16:57:57,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-06 16:57:57,643 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-06 16:57:57,830 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-06 16:57:57,864 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-06 16:57:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3933 proven. 411 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2023-09-06 16:57:57,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-06 16:57:58,121 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1)) 20))) is different from false [2023-09-06 16:57:58,138 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1)) 20))) is different from false [2023-09-06 16:57:58,195 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1))))) is different from false [2023-09-06 16:57:58,307 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2655) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2659)) .cse1)) 20))) (= .cse4 20)))) is different from false [2023-09-06 16:57:58,332 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse2 (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_2653)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2655) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1)) 20)) (= .cse4 20))))) is different from false [2023-09-06 16:57:58,344 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse5 (select .cse4 .cse1))) (or (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2655) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3)) 20)) (= .cse5 20)))))))) is different from false [2023-09-06 16:57:58,367 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 20 .cse0) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2655) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2659)) .cse2)) 20)) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|)))))) is different from false [2023-09-06 16:57:58,729 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse5 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= 20 .cse2) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2655) .cse1 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1) 20)))))))) is different from false [2023-09-06 16:57:58,742 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2655) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1))) (= 20 .cse5))))))) is different from false [2023-09-06 16:57:59,588 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2646)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse5 (select .cse9 .cse2))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2648) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse8 .cse4))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= .cse5 20) (not (= (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2655) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse4) 20))))))))))) is different from false [2023-09-06 16:58:00,464 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2648) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2655) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= .cse5 20) (= 20 .cse7) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|))))))))))) is different from false [2023-09-06 16:58:00,487 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse10 .cse3))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2648) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse0 (select .cse6 .cse3))) (or (= .cse0 20) (= .cse1 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2655) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|))))))))))) is different from false [2023-09-06 16:58:00,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2639 Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2640 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (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_2639)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2640) .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse10 .cse2))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2648) .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse0 (select .cse7 .cse2))) (or (= 20 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2655) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2659)) .cse2) 20)))))))))))) is different from false [2023-09-06 16:58:01,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2639 Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2640 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2639))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2640) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse12 .cse3))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2648) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse9 (select .cse7 .cse3))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2655) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)) (= .cse9 20) (= .cse10 20)))))))))))) is different from false [2023-09-06 16:58:02,273 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:58:02,273 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 1 case distinctions, treesize of input 2550 treesize of output 1770 [2023-09-06 16:58:02,302 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:58:02,302 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 2418 treesize of output 2380 [2023-09-06 16:58:02,320 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 367 treesize of output 355 [2023-09-06 16:58:02,332 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 38 treesize of output 30 [2023-09-06 16:58:02,343 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 38 treesize of output 30 [2023-09-06 16:58:02,354 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 13 treesize of output 9 [2023-09-06 16:58:02,385 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-06 16:58:02,428 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-06 16:58:02,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 471 treesize of output 443 [2023-09-06 16:58:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3341 proven. 580 refuted. 24 times theorem prover too weak. 1667 trivial. 378 not checked. [2023-09-06 16:58:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899092192] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-06 16:58:03,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-06 16:58:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 44] total 104 [2023-09-06 16:58:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163580421] [2023-09-06 16:58:03,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-06 16:58:03,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-09-06 16:58:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 16:58:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-09-06 16:58:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=6595, Unknown=173, NotChecked=2646, Total=10712 [2023-09-06 16:58:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:58:03,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 16:58:03,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.9423076923076925) internal successors, (826), 104 states have internal predecessors, (826), 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-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-06 16:58:03,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-06 16:58:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-06 16:58:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-09-06 16:58:45,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-09-06 16:58:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-09-06 16:58:46,030 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-06 16:58:46,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-06 16:58:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 910595484, now seen corresponding path program 3 times [2023-09-06 16:58:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-06 16:58:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096603424] [2023-09-06 16:58:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-06 16:58:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-06 16:58:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-06 16:58:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 4151 proven. 924 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2023-09-06 16:58:59,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-06 16:58:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096603424] [2023-09-06 16:58:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096603424] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-06 16:58:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730044835] [2023-09-06 16:58:59,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-06 16:58:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-06 16:58:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-06 16:58:59,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-06 16:58:59,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process Received shutdown request... [2023-09-06 17:00:42,953 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-06 17:00:42,954 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-06 17:00:42,954 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-06 17:00:43,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-09-06 17:00:44,159 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forcibly destroying the process [2023-09-06 17:00:44,159 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-09-06 17:00:44,171 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-06 17:00:44,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-09-06 17:00:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2023-09-06 17:00:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374721639] [2023-09-06 17:00:44,171 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-09-06 17:00:44,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-09-06 17:00:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-06 17:00:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-09-06 17:00:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2023-09-06 17:00:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-06 17:00:44,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-06 17:00:44,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 8.851851851851851) internal successors, (478), 54 states have internal predecessors, (478), 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-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-06 17:00:44,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-06 17:00:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-06 17:00:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-06 17:00:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-06 17:00:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-09-06 17:00:44,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-06 17:00:44,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 137 [2023-09-06 17:00:44,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-09-06 17:00:44,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-09-06 17:00:44,181 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2023-09-06 17:00:44,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-06 17:00:44,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-06 17:00:44,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-06 17:00:44,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-09-06 17:00:44,184 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-06 17:00:44,191 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2023-09-06 17:00:44,195 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-06 17:00:44,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-06 17:00:44,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.09 05:00:44 BasicIcfg [2023-09-06 17:00:44,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-06 17:00:44,200 INFO L158 Benchmark]: Toolchain (without parser) took 232365.74ms. Allocated memory was 217.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 164.8MB in the beginning and 983.2MB in the end (delta: -818.4MB). Peak memory consumption was 775.4MB. Max. memory is 7.0GB. [2023-09-06 17:00:44,200 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 156.2MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-06 17:00:44,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.41ms. Allocated memory is still 217.1MB. Free memory was 164.8MB in the beginning and 134.9MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-06 17:00:44,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.30ms. Allocated memory is still 217.1MB. Free memory was 134.4MB in the beginning and 131.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-06 17:00:44,201 INFO L158 Benchmark]: Boogie Preprocessor took 47.07ms. Allocated memory is still 217.1MB. Free memory was 131.8MB in the beginning and 129.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-06 17:00:44,201 INFO L158 Benchmark]: RCFGBuilder took 583.95ms. Allocated memory is still 217.1MB. Free memory was 129.7MB in the beginning and 108.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 7.0GB. [2023-09-06 17:00:44,201 INFO L158 Benchmark]: TraceAbstraction took 231032.31ms. Allocated memory was 217.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 108.2MB in the beginning and 983.2MB in the end (delta: -875.1MB). Peak memory consumption was 718.8MB. Max. memory is 7.0GB. [2023-09-06 17:00:44,203 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.12ms. Allocated memory is still 156.2MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 616.41ms. Allocated memory is still 217.1MB. Free memory was 164.8MB in the beginning and 134.9MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 78.30ms. Allocated memory is still 217.1MB. Free memory was 134.4MB in the beginning and 131.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 47.07ms. Allocated memory is still 217.1MB. Free memory was 131.8MB in the beginning and 129.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 583.95ms. Allocated memory is still 217.1MB. Free memory was 129.7MB in the beginning and 108.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 7.0GB. * TraceAbstraction took 231032.31ms. Allocated memory was 217.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 108.2MB in the beginning and 983.2MB in the end (delta: -875.1MB). Peak memory consumption was 718.8MB. 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: 5949, independent: 5843, independent conditional: 5843, independent unconditional: 0, dependent: 106, dependent conditional: 106, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5854, independent: 5843, independent conditional: 5843, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5854, independent: 5843, independent conditional: 5843, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5931, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 88, dependent conditional: 77, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5931, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5931, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5854, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5854, independent: 5834, independent conditional: 0, independent unconditional: 5834, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5931, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 5854, unknown conditional: 0, unknown unconditional: 5854] , Statistics on independence cache: Total cache size (in pairs): 5854, Positive cache size: 5843, Positive conditional cache size: 0, Positive unconditional cache size: 5843, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 12, Independence queries for same thread: 95 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 50, RedundantProofs: 13, ProvenStates: 116 - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 230.9s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 52.5s, 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: 303, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 67.1s InterpolantComputationTime, 11310 NumberOfCodeBlocks, 11010 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 15164 ConstructedInterpolants, 182 QuantifiedInterpolants, 124863 SizeOfPredicates, 161 NumberOfNonLiveVariables, 10307 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 82967/95739 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