/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line384.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 06:23:47,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 06:23:47,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 06:23:47,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 06:23:47,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 06:23:47,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 06:23:47,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 06:23:47,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 06:23:47,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 06:23:47,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 06:23:47,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 06:23:47,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 06:23:47,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 06:23:47,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 06:23:47,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 06:23:47,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 06:23:47,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 06:23:47,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 06:23:47,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 06:23:47,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 06:23:47,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 06:23:47,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 06:23:47,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 06:23:47,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 06:23:47,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 06:23:47,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 06:23:47,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 06:23:47,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 06:23:47,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 06:23:47,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 06:23:47,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 06:23:47,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 06:23:47,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 06:23:47,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 06:23:47,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 06:23:47,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 06:23:47,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 06:23:47,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 06:23:47,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 06:23:47,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 06:23:47,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 06:23:47,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 06:23:47,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 06:23:47,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 06:23:47,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 06:23:47,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 06:23:47,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 06:23:47,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 06:23:47,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 06:23:47,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 06:23:47,759 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 06:23:47,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 06:23:47,760 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 06:23:47,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 06:23:47,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 06:23:47,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 06:23:47,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 06:23:47,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 06:23:47,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 06:23:47,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:23:47,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 06:23:47,763 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 06:23:47,764 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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 [2022-09-30 06:23:48,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 06:23:48,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 06:23:48,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 06:23:48,028 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 06:23:48,030 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 06:23:48,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line384.bpl [2022-09-30 06:23:48,032 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line384.bpl' [2022-09-30 06:23:48,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 06:23:48,092 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 06:23:48,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 06:23:48,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 06:23:48,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 06:23:48,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 06:23:48,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 06:23:48,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 06:23:48,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 06:23:48,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/1) ... [2022-09-30 06:23:48,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:23:48,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:48,261 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) [2022-09-30 06:23:48,279 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 [2022-09-30 06:23:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 06:23:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 06:23:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 06:23:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 06:23:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 06:23:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 06:23:48,303 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 06:23:48,509 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 06:23:48,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 06:23:48,996 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 06:23:49,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 06:23:49,016 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 06:23:49,019 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:23:49 BoogieIcfgContainer [2022-09-30 06:23:49,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 06:23:49,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 06:23:49,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 06:23:49,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 06:23:49,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:23:48" (1/2) ... [2022-09-30 06:23:49,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78466d91 and model type queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 06:23:49, skipping insertion in model container [2022-09-30 06:23:49,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:23:49" (2/2) ... [2022-09-30 06:23:49,029 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line384.bpl [2022-09-30 06:23:49,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 06:23:49,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 06:23:49,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 06:23:49,042 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 06:23:49,150 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 06:23:49,208 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:49,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:49,212 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) [2022-09-30 06:23:49,213 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 [2022-09-30 06:23:49,241 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:49,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:23:49,252 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;@663d8e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:49,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:49,666 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:23:49,671 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:23:49,673 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 06:23:49,679 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:49,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:49,691 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:49,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:23:49,692 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;@663d8e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:49,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:49,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-09-30 06:23:49,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:23:49,721 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:23:49,725 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 06:23:49,735 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:49,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:49,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:49,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-09-30 06:23:49,777 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:49,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:23:49,778 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;@663d8e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:49,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:49,778 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 06:23:49,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:23:49,779 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:23:49,779 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 06:23:49,786 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:23:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:23:49,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:23:49,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:23:49,793 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:23:49,793 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:23:49,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-09-30 06:23:49,794 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;@663d8e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:23:49,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:23:49,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 812657596, now seen corresponding path program 1 times [2022-09-30 06:23:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:49,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142634980] [2022-09-30 06:23:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:23:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:23:50,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142634980] [2022-09-30 06:23:50,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142634980] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:23:50,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:23:50,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 06:23:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735069544] [2022-09-30 06:23:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:23:50,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 06:23:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:23:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 06:23:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 06:23:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:50,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:23:50,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 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) [2022-09-30 06:23:50,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:50,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 06:23:50,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1025703088, now seen corresponding path program 1 times [2022-09-30 06:23:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102139882] [2022-09-30 06:23:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:23:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:23:51,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102139882] [2022-09-30 06:23:51,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102139882] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:23:51,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:23:51,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-09-30 06:23:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451834113] [2022-09-30 06:23:51,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:23:51,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-09-30 06:23:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:23:51,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-09-30 06:23:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2022-09-30 06:23:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:51,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:23:51,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 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) [2022-09-30 06:23:51,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:51,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:23:54,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 06:23:54,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2105235900, now seen corresponding path program 1 times [2022-09-30 06:23:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:54,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021509743] [2022-09-30 06:23:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:23:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:23:54,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:23:54,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021509743] [2022-09-30 06:23:54,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021509743] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:23:54,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:23:54,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-09-30 06:23:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901403113] [2022-09-30 06:23:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:23:54,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-09-30 06:23:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:23:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-09-30 06:23:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-09-30 06:23:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:54,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:23:54,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.533333333333335) internal successors, (278), 16 states have internal predecessors, (278), 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) [2022-09-30 06:23:54,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:54,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:23:54,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:23:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:23:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:23:55,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-30 06:23:55,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:23:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:23:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash -427880057, now seen corresponding path program 1 times [2022-09-30 06:23:55,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:23:55,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066401265] [2022-09-30 06:23:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:23:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:23:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:24:10,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:24:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066401265] [2022-09-30 06:24:10,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066401265] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:24:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867154900] [2022-09-30 06:24:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:10,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:10,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:24:10,048 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) [2022-09-30 06:24:10,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-30 06:24:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:10,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 158 conjunts are in the unsatisfiable core [2022-09-30 06:24:10,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:24:10,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:24:10,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:24:11,061 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:24:11,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 06:24:11,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 06:24:11,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:24:12,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:12,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:24:13,164 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:24:13,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 22 [2022-09-30 06:24:13,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:24:15,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:24:15,037 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:24:15,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:24:15,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:15,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-09-30 06:24:17,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 31 [2022-09-30 06:24:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:17,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 38 [2022-09-30 06:24:19,161 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:24:19,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 43 [2022-09-30 06:24:19,470 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:24:19,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-09-30 06:24:19,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:24:19,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:24:19,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:24:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:24:19,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:24:43,783 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 06:24:43,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 112 [2022-09-30 06:24:43,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:43,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 160 treesize of output 160 [2022-09-30 06:24:43,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:24:43,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 77 [2022-09-30 06:24:43,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 69 [2022-09-30 06:24:43,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-09-30 06:24:43,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:24:43,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:43,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 150 treesize of output 142 [2022-09-30 06:24:45,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 50 [2022-09-30 06:24:46,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:46,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 58 [2022-09-30 06:24:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:24:46,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867154900] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:24:46,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:24:46,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 59, 61] total 179 [2022-09-30 06:24:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368784114] [2022-09-30 06:24:46,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:24:46,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 179 states [2022-09-30 06:24:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:24:46,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2022-09-30 06:24:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=30166, Unknown=501, NotChecked=0, Total=31862 [2022-09-30 06:24:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:46,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:24:46,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 179 states, 179 states have (on average 5.067039106145251) internal successors, (907), 179 states have internal predecessors, (907), 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) [2022-09-30 06:24:46,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:46,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:24:46,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:24:46,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:09,114 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse46 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse54 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (.cse19 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse51 (@diff .cse14 .cse3)) (.cse18 (@diff .cse19 .cse3)) (.cse1 (@diff .cse0 .cse3)) (.cse53 (@diff .cse54 .cse3)) (.cse45 (@diff .cse46 .cse3)) (.cse6 (@diff .cse7 .cse3))) (let ((.cse56 (store .cse7 .cse6 0)) (.cse37 (store .cse46 .cse45 0)) (.cse39 (store .cse54 .cse53 0)) (.cse48 (store .cse0 .cse1 0)) (.cse43 (store .cse19 .cse18 0)) (.cse58 (store .cse14 .cse51 0))) (let ((.cse57 (@diff .cse58 .cse3)) (.cse44 (@diff .cse43 .cse3)) (.cse47 (@diff .cse48 .cse3)) (.cse38 (@diff .cse39 .cse3)) (.cse36 (@diff .cse37 .cse3)) (.cse55 (@diff .cse56 .cse3)) (.cse33 (select |c_#memory_int| 7)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse52 (select .cse33 .cse2)) (.cse41 (select .cse7 .cse2)) (.cse49 (store .cse56 .cse55 0)) (.cse59 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse2)) (.cse35 (store .cse37 .cse36 0)) (.cse20 (store .cse39 .cse38 0)) (.cse29 (store .cse48 .cse47 0)) (.cse15 (+ |c_~#queue~0.offset| 3204)) (.cse27 (select |c_#length| |c_~#queue~0.base|)) (.cse9 (store .cse43 .cse44 0)) (.cse4 (store .cse58 .cse57 0))) (let ((.cse5 (@diff .cse4 .cse3)) (.cse8 (select .cse54 .cse2)) (.cse17 (select .cse33 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (.cse32 (<= (select |c_#length| 7) 4)) (.cse10 (@diff .cse9 .cse3)) (.cse12 (<= .cse27 4)) (.cse28 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse15)) (.cse13 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse30 (@diff .cse29 .cse3)) (.cse21 (@diff .cse20 .cse3)) (.cse34 (@diff .cse35 .cse3)) (.cse16 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) (.cse31 (<= .cse59 1)) (.cse11 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse50 (@diff .cse49 .cse3)) (.cse42 (+ (* .cse41 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse40 (<= .cse52 1))) (and (or (and (<= (select .cse0 .cse1) 0) (<= .cse1 .cse2)) (<= 3208 .cse1) (= .cse3 .cse0) (<= .cse1 3200)) (or (= .cse3 .cse4) (<= .cse5 3200) (<= 3208 .cse5)) (= 3204 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (or (<= 3208 .cse6) (= .cse3 .cse7) (<= .cse6 3200)) (not (= .cse8 800)) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= .cse3 (store .cse9 .cse10 0)) (<= .cse11 4) (or .cse12 (and .cse13 (<= (select .cse14 .cse15) 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse16) 0) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse8) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= .cse3 (store .cse4 .cse5 0)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= 801 .cse17)) (= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse8) (or (<= .cse18 3200) (<= 3208 .cse18) (= .cse3 .cse19)) (or (= .cse3 .cse20) (<= 3208 .cse21) (<= .cse21 3200)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (v_ArrVal_151 (Array Int Int)) (v_ArrVal_144 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_142)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_144))) (let ((.cse22 (select .cse24 |c_~#queue~0.base|))) (let ((.cse25 (store (store .cse22 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse23 (+ |c_~#queue~0.offset| 3204))) (let ((.cse26 (select .cse25 .cse23))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse22 .cse23))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (< (select (select (store (store .cse24 |c_~#queue~0.base| (store .cse25 .cse23 (+ .cse26 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse23) 800) (= .cse26 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))))))) (< .cse27 (+ 3212 |c_~#queue~0.offset|))) (or .cse12 (and .cse13 (<= .cse28 1))) (= .cse3 (store .cse29 .cse30 0)) (or (and .cse13 .cse31) .cse32) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse33 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (or (<= .cse34 3200) (= .cse3 .cse35) (<= 3208 .cse34)) (or (<= 3208 .cse36) (= .cse3 .cse37) (<= .cse36 3200)) (= .cse8 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= (select .cse19 .cse15) 0) (or (<= .cse38 3200) (= .cse3 .cse39) (<= 3208 .cse38)) (or (and .cse13 (<= .cse17 1)) .cse32) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (and .cse13 .cse40) .cse32) (or (<= 3208 .cse10) (= .cse3 .cse9) (<= .cse10 3200)) (not (= 801 .cse28)) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or .cse12 (and (<= .cse28 0) .cse13)) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse41) (or (and (<= .cse30 .cse2) (<= (select .cse0 .cse30) 0)) (= .cse3 .cse29) (<= 3208 .cse30) (<= .cse30 3200)) (= .cse2 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= .cse3 (store .cse20 .cse21 0)) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_139 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_139) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= .cse42 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| 0) (= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (= .cse3 .cse43) (<= .cse44 3200) (<= 3208 .cse44)) (or (<= .cse45 3200) (= .cse3 .cse46) (<= 3208 .cse45)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (or (<= .cse47 3200) (<= 3208 .cse47) (and (<= .cse47 .cse2) (<= (select .cse0 .cse47) 0)) (= .cse3 .cse48)) (= .cse3 (store .cse35 .cse34 0)) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse16) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) .cse31 (= .cse41 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (not (= .cse27 .cse11)) (= .cse3 (store .cse49 .cse50 0)) (or (<= 3208 .cse51) (= .cse3 .cse14) (<= .cse51 3200)) (not (= .cse52 801)) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (or (<= .cse50 3200) (<= 3208 .cse50) (= .cse3 .cse49)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| .cse42) (or (<= .cse53 3200) (<= 3208 .cse53) (= .cse3 .cse54)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) .cse40 (or (<= 3208 .cse55) (<= .cse55 3200) (= .cse3 .cse56)) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) (or (<= .cse57 3200) (<= 3208 .cse57) (= .cse3 .cse58)) (not (= 801 .cse59))))))))) is different from true [2022-09-30 06:26:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:26:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:26:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-09-30 06:26:30,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-30 06:26:30,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:26:30,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:26:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:26:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash -105076603, now seen corresponding path program 1 times [2022-09-30 06:26:30,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:26:30,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982467191] [2022-09-30 06:26:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:26:30,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:26:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:26:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:26:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:26:31,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982467191] [2022-09-30 06:26:31,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982467191] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:26:31,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978557484] [2022-09-30 06:26:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:26:31,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:26:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:26:31,128 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) [2022-09-30 06:26:31,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-30 06:26:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:26:31,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 71 conjunts are in the unsatisfiable core [2022-09-30 06:26:31,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:26:32,649 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-09-30 06:26:32,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2022-09-30 06:26:32,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:26:33,225 INFO L356 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-09-30 06:26:33,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2022-09-30 06:26:33,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:26:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:26:35,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:26:49,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:49,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 157 treesize of output 159 [2022-09-30 06:26:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:26:50,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978557484] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:26:50,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:26:50,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 34, 17] total 64 [2022-09-30 06:26:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516081864] [2022-09-30 06:26:50,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:26:50,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-09-30 06:26:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:26:50,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-09-30 06:26:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3780, Unknown=0, NotChecked=0, Total=4160 [2022-09-30 06:26:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:50,361 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:26:50,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 16.390625) internal successors, (1049), 65 states have internal predecessors, (1049), 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) [2022-09-30 06:26:50,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:50,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:26:50,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:26:50,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-09-30 06:26:50,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:26:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:26:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-09-30 06:26:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-09-30 06:26:55,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-30 06:26:56,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:26:56,041 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:26:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:26:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1802644901, now seen corresponding path program 2 times [2022-09-30 06:26:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:26:56,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322653001] [2022-09-30 06:26:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:26:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:26:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:26:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 216 proven. 183 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-09-30 06:26:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:26:56,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322653001] [2022-09-30 06:26:56,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322653001] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:26:56,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833394760] [2022-09-30 06:26:56,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 06:26:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:26:56,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:26:56,873 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) [2022-09-30 06:26:56,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-30 06:26:57,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 06:26:57,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:26:57,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 64 conjunts are in the unsatisfiable core [2022-09-30 06:26:57,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:26:58,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:26:58,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:58,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:26:58,819 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:26:58,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-09-30 06:26:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:58,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:26:59,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:26:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 150 proven. 183 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-09-30 06:26:59,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:27:41,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_321) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2022-09-30 06:27:41,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (forall ((v_ArrVal_321 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:27:41,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:27:41,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:27:41,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-09-30 06:27:41,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:27:41,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-09-30 06:27:41,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-09-30 06:27:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 134 proven. 173 refuted. 0 times theorem prover too weak. 104 trivial. 26 not checked. [2022-09-30 06:27:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833394760] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:27:42,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:27:42,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 22] total 66 [2022-09-30 06:27:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415196973] [2022-09-30 06:27:42,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:27:42,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-09-30 06:27:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:27:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-09-30 06:27:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3628, Unknown=54, NotChecked=372, Total=4290 [2022-09-30 06:27:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:27:42,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:27:42,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 18.21212121212121) internal successors, (1202), 66 states have internal predecessors, (1202), 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) [2022-09-30 06:27:42,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:27:42,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:27:42,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:27:42,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-09-30 06:27:42,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-09-30 06:27:42,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:27:43,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 .cse1) 1) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= (select .cse2 3204) 1) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#value#1| 1) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= (select .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) 1) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= .cse1 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select .cse3 3204) 1) (<= (select .cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 1) (= (select .cse0 3204) 1) (= 3204 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (forall ((v_ArrVal_321 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6) (<= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:27:43,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 3204) 1) (forall ((v_ArrVal_321 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (< (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 06:27:43,788 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 7 |c_~#queue~0.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 3204) 1) (<= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| Int)) (or (forall ((v_ArrVal_321 (Array Int Int))) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| v_ArrVal_321) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_69| |c_~#stored_elements~0.base|)))))) is different from false [2022-09-30 06:27:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:27:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:27:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:27:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-09-30 06:27:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-09-30 06:27:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-30 06:27:46,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-30 06:27:46,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:27:46,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:27:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:27:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1137798567, now seen corresponding path program 3 times [2022-09-30 06:27:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:27:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559093359] [2022-09-30 06:27:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:27:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:27:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:27:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 257 proven. 202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-09-30 06:27:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:27:49,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559093359] [2022-09-30 06:27:49,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559093359] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:27:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521206952] [2022-09-30 06:27:49,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-30 06:27:49,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:27:49,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:27:49,321 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) [2022-09-30 06:27:49,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-30 06:27:49,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-30 06:27:49,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:27:49,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-30 06:27:49,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:27:49,959 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-30 06:27:49,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-30 06:27:50,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 06:27:50,214 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-30 06:27:50,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:27:50,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 06:27:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 247 proven. 3 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-09-30 06:27:52,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:27:54,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:27:54,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 62 [2022-09-30 06:27:55,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:27:55,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 64 treesize of output 218 [2022-09-30 06:27:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-09-30 06:27:57,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521206952] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:27:57,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:27:57,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 18, 18] total 106 [2022-09-30 06:27:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52529603] [2022-09-30 06:27:57,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:27:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-09-30 06:27:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:27:57,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-09-30 06:27:57,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=10587, Unknown=0, NotChecked=0, Total=11130 [2022-09-30 06:27:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:27:57,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:27:57,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 11.31132075471698) internal successors, (1199), 106 states have internal predecessors, (1199), 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) [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-30 06:27:57,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:31:35,749 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_39| Int) (v_ArrVal_154 Int)) (or (< (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_39| v_ArrVal_154) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_39|)))) (not (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 800))) is different from false Received shutdown request... [2022-09-30 06:34:21,934 WARN L249 SmtUtils]: Removed 32 from assertion stack [2022-09-30 06:34:21,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-09-30 06:34:21,974 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:34:21,974 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:34:21,974 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 [2022-09-30 06:34:21,978 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:34:21,978 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 [2022-09-30 06:34:21,978 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:34:22,134 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,SelfDestructingSolverStorable6 [2022-09-30 06:34:22,135 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 107 for 24ms.. [2022-09-30 06:34:22,135 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:34:22,136 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-09-30 06:34:22,137 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-09-30 06:34:22,140 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-30 06:34:22,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-30 06:34:22,143 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 06:34:22 BasicIcfg [2022-09-30 06:34:22,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-30 06:34:22,143 INFO L158 Benchmark]: Toolchain (without parser) took 634051.37ms. Allocated memory was 175.1MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 124.5MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-09-30 06:34:22,144 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 175.1MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-30 06:34:22,144 INFO L158 Benchmark]: Boogie Preprocessor took 99.13ms. Allocated memory is still 175.1MB. Free memory was 124.5MB in the beginning and 121.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-30 06:34:22,144 INFO L158 Benchmark]: RCFGBuilder took 803.72ms. Allocated memory was 175.1MB in the beginning and 287.3MB in the end (delta: 112.2MB). Free memory was 121.1MB in the beginning and 235.3MB in the end (delta: -114.2MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2022-09-30 06:34:22,144 INFO L158 Benchmark]: TraceAbstraction took 633122.28ms. Allocated memory was 287.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 234.7MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-09-30 06:34:22,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 175.1MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 99.13ms. Allocated memory is still 175.1MB. Free memory was 124.5MB in the beginning and 121.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 803.72ms. Allocated memory was 175.1MB in the beginning and 287.3MB in the end (delta: 112.2MB). Free memory was 121.1MB in the beginning and 235.3MB in the end (delta: -114.2MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. * TraceAbstraction took 633122.28ms. Allocated memory was 287.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 234.7MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1688, positive: 1674, positive conditional: 0, positive unconditional: 1674, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, positive: 1637, positive conditional: 0, positive unconditional: 1637, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1688, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 80, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 97, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 95, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 106, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 191, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 18, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 202, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 24, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 372, positive: 362, positive conditional: 362, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 34, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 383, positive: 373, positive conditional: 373, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 44, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 10136570, positive: 9869915, positive conditional: 9869915, positive unconditional: 0, negative: 266655, negative conditional: 266655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10138016, positive: 9871317, positive conditional: 9871317, positive unconditional: 0, negative: 266699, negative conditional: 266699, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9910490, positive: 9871317, positive conditional: 0, positive unconditional: 9871317, negative: 39173, negative conditional: 0, negative unconditional: 39173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21617, positive: 21488, positive conditional: 0, positive unconditional: 21488, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9910490, positive: 9849829, positive conditional: 0, positive unconditional: 9849829, negative: 39044, negative conditional: 0, negative unconditional: 39044, unknown: 21617, unknown conditional: 0, unknown unconditional: 21617] , Statistics on independence cache: Total cache size (in pairs): 21617, Positive cache size: 21488, Positive conditional cache size: 0, Positive unconditional cache size: 21488, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Independence queries for same thread: 227526, Statistics for Abstraction: - TimeoutResultAtElement [Line: 384]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 107 for 24ms.. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 632.3s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 501.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 549, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 128.2s InterpolantComputationTime, 4422 NumberOfCodeBlocks, 4238 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 6211 ConstructedInterpolants, 458 QuantifiedInterpolants, 135422 SizeOfPredicates, 222 NumberOfNonLiveVariables, 3546 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 1722/3159 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