/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-10-04 00:58:20,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:58:20,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:58:20,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:58:20,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:58:20,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:58:20,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:58:20,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:58:20,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:58:20,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:58:20,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:58:20,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:58:20,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:58:20,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:58:20,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:58:20,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:58:20,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:58:20,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:58:20,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:58:20,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:58:20,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:58:20,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:58:20,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:58:20,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:58:20,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:58:20,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:58:20,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:58:20,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:58:20,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:58:20,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:58:20,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:58:20,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:58:20,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:58:20,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:58:20,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:58:20,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:58:20,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:58:20,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:58:20,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:58:20,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:58:20,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:58:20,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:58:20,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:58:20,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:58:20,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:58:20,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:58:20,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:58:20,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:58:20,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:58:20,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:58:20,607 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:58:20,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:58:20,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:58:20,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:58:20,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:58:20,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:58:20,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:58:20,610 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:58:20,611 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:58:20,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:58:20,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:58:20,611 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:58:20,611 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:58:20,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:58:20,611 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-10-04 00:58:20,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:58:20,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:58:20,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:58:20,802 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:58:20,804 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:58:20,805 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-10-04 00:58:20,805 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-10-04 00:58:20,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:58:20,853 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:58:20,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:58:20,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:58:20,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:58:20,864 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,865 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,893 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,893 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,913 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,916 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,919 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 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:58:20,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:58:20,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:58:20,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:58:20,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:20" (1/1) ... [2022-10-04 00:58:20,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:58:20,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:20,964 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-10-04 00:58:20,972 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-10-04 00:58:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:58:21,003 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:58:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:58:21,003 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:58:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:58:21,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:58:21,004 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:58:21,150 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:58:21,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:58:21,673 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:58:21,693 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:58:21,693 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:58:21,695 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:58:21 BoogieIcfgContainer [2022-10-04 00:58:21,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:58:21,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:58:21,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:58:21,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:58:21,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:58:20" (1/2) ... [2022-10-04 00:58:21,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca3fa25 and model type queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:58:21, skipping insertion in model container [2022-10-04 00:58:21,702 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 04.10 12:58:21" (2/2) ... [2022-10-04 00:58:21,703 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line384.bpl [2022-10-04 00:58:21,709 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:58:21,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:58:21,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:58:21,715 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:58:21,805 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:58:21,847 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:58:21,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:58:21,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:21,849 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-10-04 00:58:21,854 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-10-04 00:58:21,877 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:58:21,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:58:21,886 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;@163eb571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:58:21,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:58:22,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:58:22,198 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:58:22,200 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:58:22,213 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:58:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:58:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:22,215 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-10-04 00:58:22,216 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-10-04 00:58:22,218 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:58:22,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:58:22,219 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;@163eb571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:58:22,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:58:22,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:58:22,237 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:58:22,238 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:58:22,241 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:58:22,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:58:22,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:22,289 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-10-04 00:58:22,291 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-10-04 00:58:22,293 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:58:22,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:58:22,294 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;@163eb571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:58:22,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:58:22,294 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:58:22,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:58:22,295 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:58:22,295 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:58:22,298 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:58:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:58:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:22,303 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-10-04 00:58:22,304 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-10-04 00:58:22,307 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:58:22,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:58:22,307 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;@163eb571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:58:22,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:58:22,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 812657596, now seen corresponding path program 1 times [2022-10-04 00:58:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:22,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956526093] [2022-10-04 00:58:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:22,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956526093] [2022-10-04 00:58:22,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956526093] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:58:22,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:58:22,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:58:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568667147] [2022-10-04 00:58:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:58:22,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:58:22,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:58:22,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:58:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:22,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:22,762 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-10-04 00:58:22,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:22,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:58:22,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:22,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1025703088, now seen corresponding path program 1 times [2022-10-04 00:58:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:22,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014181772] [2022-10-04 00:58:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:23,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014181772] [2022-10-04 00:58:23,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014181772] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:58:23,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:58:23,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-10-04 00:58:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275536678] [2022-10-04 00:58:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:58:23,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-04 00:58:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-04 00:58:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2022-10-04 00:58:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:23,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:23,912 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-10-04 00:58:23,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:23,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:58:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:58:26,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2105235900, now seen corresponding path program 1 times [2022-10-04 00:58:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:26,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670613559] [2022-10-04 00:58:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:26,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:26,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670613559] [2022-10-04 00:58:26,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670613559] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:58:26,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:58:26,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-04 00:58:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461614993] [2022-10-04 00:58:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:58:26,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-04 00:58:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:58:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-04 00:58:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-10-04 00:58:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:26,601 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:58:26,605 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-10-04 00:58:26,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:26,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:58:26,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:58:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:58:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:58:27,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:58:27,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:58:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:58:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -427880057, now seen corresponding path program 1 times [2022-10-04 00:58:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:58:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136279975] [2022-10-04 00:58:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:58:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:58:40,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136279975] [2022-10-04 00:58:40,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136279975] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:58:40,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931205804] [2022-10-04 00:58:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:58:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:58:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:58:40,849 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-10-04 00:58:40,852 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-10-04 00:58:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:58:41,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 158 conjunts are in the unsatisfiable core [2022-10-04 00:58:41,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:58:41,334 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-10-04 00:58:41,448 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-10-04 00:58:41,762 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:58:41,763 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-10-04 00:58:41,866 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-10-04 00:58:42,371 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-10-04 00:58:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:42,706 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-10-04 00:58:43,514 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:58:43,514 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-10-04 00:58:43,533 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-10-04 00:58:45,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:58:45,047 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:58:45,047 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-10-04 00:58:45,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:45,565 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-10-04 00:58:47,191 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-10-04 00:58:47,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:47,698 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-10-04 00:58:48,708 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:58:48,709 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-10-04 00:58:48,979 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:58:48,979 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-10-04 00:58:49,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:49,268 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-10-04 00:58:49,359 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-10-04 00:58:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:49,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:59:12,433 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 00:59:12,433 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-10-04 00:59:12,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:59:12,449 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-10-04 00:59:12,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:59:12,459 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-10-04 00:59:12,466 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-10-04 00:59:12,502 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-10-04 00:59:12,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:59:12,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:59:12,596 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-10-04 00:59:14,276 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-10-04 00:59:14,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:59:14,517 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-10-04 00:59:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:59:14,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931205804] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:59:14,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:59:14,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 59, 61] total 179 [2022-10-04 00:59:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491537699] [2022-10-04 00:59:14,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:59:14,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 179 states [2022-10-04 00:59:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:59:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2022-10-04 00:59:14,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=30166, Unknown=501, NotChecked=0, Total=31862 [2022-10-04 00:59:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:59:14,821 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:59:14,822 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-10-04 00:59:14,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:59:14,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:59:14,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:59:14,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:41,600 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 338 DAG size of output: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:52,736 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 293 DAG size of output: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:01:08,749 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 314 DAG size of output: 164 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:01:17,954 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 293 DAG size of output: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:01:37,739 WARN L233 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 276 DAG size of output: 169 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:02:31,793 WARN L233 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 286 DAG size of output: 170 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:02:55,299 WARN L233 SmtUtils]: Spent 13.37s on a formula simplification. DAG size of input: 304 DAG size of output: 174 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:03:26,511 WARN L233 SmtUtils]: Spent 14.98s on a formula simplification. DAG size of input: 314 DAG size of output: 177 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:03:47,550 WARN L233 SmtUtils]: Spent 15.93s on a formula simplification. DAG size of input: 319 DAG size of output: 179 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:04:57,877 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse13 ((as const (Array Int Int)) 0))) (let ((.cse18 (@diff .cse19 .cse13))) (let ((.cse58 (store .cse19 .cse18 0))) (let ((.cse59 (@diff .cse58 .cse13)) (.cse67 (select |c_#memory_int| 7)) (.cse60 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse62 (select .cse67 .cse60)) (.cse20 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse14 (store .cse58 .cse59 0)) (.cse61 (select |c_#length| |c_~#queue~0.base|)) (.cse47 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse48 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select .cse47 .cse48)) (.cse11 (<= .cse61 4)) (.cse17 (select .cse67 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (.cse12 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse49 (<= (select |c_#length| 7) 4)) (.cse15 (@diff .cse14 .cse13)) (.cse26 (select .cse20 .cse48)) (.cse16 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse5 (< .cse61 (+ 3212 |c_~#queue~0.offset|))) (.cse50 (<= .cse62 1))) (and (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 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 ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_144))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse4 .cse1))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (= 800 .cse2) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse1) 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|)))))))) .cse5) (not (= 801 .cse6)) (or .cse5 (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store (store .cse10 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (select .cse7 .cse8))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse7 .cse8 (+ .cse9 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (= .cse9 800) (< (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse10 .cse8) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)))))))) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or .cse11 (and (<= .cse6 1) .cse12)) (= .cse13 (store .cse14 .cse15 0)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))) .cse5) (<= .cse16 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= 801 .cse17)) (or (<= .cse18 3200) (<= 3208 .cse18) (= .cse13 .cse19)) (<= (select .cse20 3204) 1) (<= (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 ((.cse23 (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 ((.cse21 (select .cse23 |c_~#queue~0.base|))) (let ((.cse24 (store (store .cse21 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse22 (+ |c_~#queue~0.offset| 3204))) (let ((.cse25 (select .cse24 .cse22))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse21 .cse22))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (< (select (select (store (store .cse23 |c_~#queue~0.base| (store .cse24 .cse22 (+ .cse25 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse22) 800) (= .cse25 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|)))))))) .cse5) (or .cse11 (and .cse12 (<= .cse26 1))) (or .cse5 (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int))) (let ((.cse28 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_147)))) (let ((.cse29 (select .cse28 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse30 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse27 (select .cse29 .cse30))) (or (= .cse27 800) (< (select (select (store (store .cse28 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse29 .cse30 (+ .cse27 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))))) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse31 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse32 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse33 (select .cse31 .cse32))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse31 .cse32 (+ .cse33 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (= 800 .cse33) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))) .cse5) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse35 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse36 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse34 (select .cse35 .cse36))) (or (= 800 .cse34) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse35 .cse36 (+ .cse34 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))) .cse5) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_17| 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 ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_17| v_ArrVal_142)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_144))) (let ((.cse37 (select .cse40 |c_~#queue~0.base|))) (let ((.cse41 (store (store .cse37 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse38 (+ |c_~#queue~0.offset| 3204))) (let ((.cse39 (select .cse41 .cse38))) (or (< (+ (* (select .cse37 .cse38) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (= .cse39 800) (< (select (select (store (store .cse40 |c_~#queue~0.base| (store .cse41 .cse38 (+ .cse39 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse38) 800) (not (<= (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_17|)) (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|)))))))) .cse5) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_147 Int) (v_ArrVal_145 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 ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_144))) (let ((.cse42 (select .cse45 |c_~#queue~0.base|))) (let ((.cse46 (store (store .cse42 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse43 (+ |c_~#queue~0.offset| 3204))) (let ((.cse44 (select .cse46 .cse43))) (or (< (+ (* (select .cse42 .cse43) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (= 800 .cse44) (< (select (select (store (store .cse45 |c_~#queue~0.base| (store .cse46 .cse43 (+ .cse44 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse43) 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|)))))))) .cse5) (<= (select .cse47 3204) 1) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| 6) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (<= (select .cse19 .cse48) 0) (or (and .cse12 (<= .cse17 1)) .cse49) (or (and .cse12 .cse50) .cse49) (or .cse5 (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse51 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse54 (store (store .cse51 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse52 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse53 (select .cse54 .cse52))) (or (< (+ (* (select .cse51 .cse52) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (= 800 .cse53) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse54 .cse52 (+ .cse53 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))))) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 3204) 1) (or (<= 3208 .cse15) (= .cse13 .cse14) (<= .cse15 3200)) (not (= 801 .cse26)) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int))) (or (< (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_write~int_#value#1|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))) .cse5) (or (< (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_152 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_152) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (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|)))))) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse56 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse57 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse55 (select .cse56 .cse57))) (or (= 800 .cse55) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse56 .cse57 (+ .cse55 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))) .cse5) (= (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|)) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 800)) (= 7 |c_~#queue~0.base|) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= 7 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (= .cse13 .cse58) (<= .cse59 3200) (<= 3208 .cse59)) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|)) (<= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse60) 1) (not (= .cse61 .cse16)) (forall ((v_ArrVal_154 Int)) (< (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_154)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (not (= .cse62 801)) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (or .cse5 (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int)) (let ((.cse63 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_145)))) (let ((.cse64 (store (select .cse63 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse65 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse66 (select .cse64 .cse65))) (or (< (select (select (store (store .cse63 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse64 .cse65 (+ .cse66 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (= .cse66 800) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))))) (<= |c_~#stored_elements~0.base| 6) .cse50 (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))))))) is different from true [2022-10-04 01:08:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:08:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 01:08:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 01:08:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-10-04 01:08:39,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 01:08:39,316 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-10-04 01:08:39,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:08:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:08:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -105076603, now seen corresponding path program 1 times [2022-10-04 01:08:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:08:39,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643710564] [2022-10-04 01:08:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:08:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:08:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:08:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:08:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:08:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643710564] [2022-10-04 01:08:39,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643710564] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:08:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366967673] [2022-10-04 01:08:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:08:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:08:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:08:39,799 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-10-04 01:08:39,800 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-10-04 01:08:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:08:40,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 71 conjunts are in the unsatisfiable core [2022-10-04 01:08:40,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:08:41,429 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-04 01:08:41,429 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-10-04 01:08:41,724 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-10-04 01:08:42,170 INFO L356 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-10-04 01:08:42,170 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-10-04 01:08:42,423 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-10-04 01:08:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:08:45,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:08:58,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:08:58,251 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-10-04 01:08:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:08:58,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366967673] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:08:58,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:08:58,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 34, 17] total 64 [2022-10-04 01:08:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028541181] [2022-10-04 01:08:58,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:08:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-04 01:08:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:08:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-04 01:08:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3780, Unknown=0, NotChecked=0, Total=4160 [2022-10-04 01:08:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:08:58,807 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:08:58,808 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-10-04 01:08:58,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:08:58,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 01:08:58,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 01:08:58,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2022-10-04 01:08:58,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:09:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:09:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 01:09:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 01:09:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-10-04 01:09:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-04 01:09:10,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 01:09:10,623 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-10-04 01:09:10,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:09:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:09:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1099893173, now seen corresponding path program 2 times [2022-10-04 01:09:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:09:10,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227649246] [2022-10-04 01:09:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:09:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:09:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:09:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 27 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:09:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:09:15,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227649246] [2022-10-04 01:09:15,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227649246] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:09:15,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804761298] [2022-10-04 01:09:15,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:09:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:09:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:09:15,174 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-10-04 01:09:15,175 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-10-04 01:09:15,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 01:09:15,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:09:15,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 88 conjunts are in the unsatisfiable core [2022-10-04 01:09:15,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:09:17,008 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-04 01:09:17,008 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-10-04 01:09:17,369 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-10-04 01:09:18,139 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-10-04 01:09:18,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 46 [2022-10-04 01:09:18,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-10-04 01:09:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 294 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:09:34,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:09:42,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:09:42,897 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 258 treesize of output 272 [2022-10-04 01:09:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 274 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:09:46,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804761298] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:09:46,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:09:46,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 43, 29] total 156 [2022-10-04 01:09:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947302248] [2022-10-04 01:09:46,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:09:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2022-10-04 01:09:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:09:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2022-10-04 01:09:46,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=981, Invalid=23199, Unknown=0, NotChecked=0, Total=24180 [2022-10-04 01:09:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:09:46,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:09:46,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 156 states have (on average 10.051282051282051) internal successors, (1568), 156 states have internal predecessors, (1568), 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-10-04 01:09:46,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:09:46,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 01:09:46,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 01:09:46,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-10-04 01:09:46,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-10-04 01:09:46,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:11:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:11:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 01:11:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 01:11:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-10-04 01:11:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-04 01:11:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-10-04 01:11:36,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-04 01:11:36,435 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-10-04 01:11:36,436 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:11:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:11:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash -378706025, now seen corresponding path program 2 times [2022-10-04 01:11:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:11:36,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188525214] [2022-10-04 01:11:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:11:36,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:11:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:11:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:11:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:11:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188525214] [2022-10-04 01:11:37,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188525214] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:11:37,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282500955] [2022-10-04 01:11:37,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:11:37,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:11:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:11:37,400 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-10-04 01:11:37,402 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-10-04 01:11:37,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 01:11:37,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:11:37,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 134 conjunts are in the unsatisfiable core [2022-10-04 01:11:37,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:11:39,231 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-04 01:11:39,237 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-10-04 01:11:39,526 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-10-04 01:11:40,216 INFO L356 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-10-04 01:11:40,216 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-10-04 01:11:40,564 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-10-04 01:11:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:11:57,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:12:04,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:12:04,167 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 320 treesize of output 332 [2022-10-04 01:12:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:12:07,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282500955] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:12:07,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:12:07,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 48, 28] total 99 [2022-10-04 01:12:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519627836] [2022-10-04 01:12:07,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:12:07,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-10-04 01:12:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:12:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-10-04 01:12:07,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=9107, Unknown=0, NotChecked=0, Total=9900 [2022-10-04 01:12:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:12:07,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:12:07,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 16.171717171717173) internal successors, (1601), 100 states have internal predecessors, (1601), 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-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2022-10-04 01:12:07,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-10-04 01:12:17,580 WARN L249 SmtUtils]: Removed 33 from assertion stack [2022-10-04 01:12:17,584 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-10-04 01:12:17,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-04 01:12:17,608 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-10-04 01:12:17,608 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-10-04 01:12:17,608 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-10-04 01:12:17,626 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-10-04 01:12:17,626 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-10-04 01:12:17,781 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-10-04 01:12:17,781 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 154 for 52ms.. [2022-10-04 01:12:17,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 01:12:17,782 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-10-04 01:12:17,783 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-10-04 01:12:17,785 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 01:12:17,785 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 01:12:17,787 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:12:17 BasicIcfg [2022-10-04 01:12:17,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 01:12:17,788 INFO L158 Benchmark]: Toolchain (without parser) took 836934.73ms. Allocated memory was 203.4MB in the beginning and 471.9MB in the end (delta: 268.4MB). Free memory was 160.7MB in the beginning and 262.7MB in the end (delta: -102.0MB). Peak memory consumption was 167.8MB. Max. memory is 8.0GB. [2022-10-04 01:12:17,788 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 203.4MB. Free memory was 164.3MB in the beginning and 164.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 01:12:17,788 INFO L158 Benchmark]: Boogie Preprocessor took 68.91ms. Allocated memory is still 203.4MB. Free memory was 160.6MB in the beginning and 157.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-04 01:12:17,788 INFO L158 Benchmark]: RCFGBuilder took 759.80ms. Allocated memory is still 203.4MB. Free memory was 157.2MB in the beginning and 158.8MB in the end (delta: -1.6MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2022-10-04 01:12:17,788 INFO L158 Benchmark]: TraceAbstraction took 836090.46ms. Allocated memory was 203.4MB in the beginning and 471.9MB in the end (delta: 268.4MB). Free memory was 158.1MB in the beginning and 262.7MB in the end (delta: -104.5MB). Peak memory consumption was 165.5MB. Max. memory is 8.0GB. [2022-10-04 01:12:17,789 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.11ms. Allocated memory is still 203.4MB. Free memory was 164.3MB in the beginning and 164.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 68.91ms. Allocated memory is still 203.4MB. Free memory was 160.6MB in the beginning and 157.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 759.80ms. Allocated memory is still 203.4MB. Free memory was 157.2MB in the beginning and 158.8MB in the end (delta: -1.6MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 836090.46ms. Allocated memory was 203.4MB in the beginning and 471.9MB in the end (delta: 268.4MB). Free memory was 158.1MB in the beginning and 262.7MB in the end (delta: -104.5MB). Peak memory consumption was 165.5MB. 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: 91, positive conditional: 91, 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 6, 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 14, 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 20, 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 26, Statistics for Abstraction: - StatisticsResult: Independence relation #6 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 394, positive: 384, positive conditional: 384, 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: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 464, positive: 453, positive conditional: 453, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1932, positive: 1875, positive conditional: 1875, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1875, positive: 1875, positive conditional: 0, positive unconditional: 1875, 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: 215, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1875, positive: 1660, positive conditional: 0, positive unconditional: 1660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 215, unknown conditional: 0, unknown unconditional: 215] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 57, 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 154 for 52ms.. - 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.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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: 835.5s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 697.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 524, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 134.8s InterpolantComputationTime, 4466 NumberOfCodeBlocks, 4466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 6277 ConstructedInterpolants, 1355 QuantifiedInterpolants, 205026 SizeOfPredicates, 273 NumberOfNonLiveVariables, 3976 ConjunctsInSsa, 451 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 622/3432 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