/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/divinefifo-bug_1w1r.line1169.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:25:48,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:25:48,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:25:48,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:25:48,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:25:48,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:25:48,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:25:48,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:25:48,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:25:48,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:25:48,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:25:48,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:25:48,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:25:48,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:25:48,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:25:48,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:25:48,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:25:48,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:25:48,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:25:49,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:25:49,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:25:49,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:25:49,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:25:49,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:25:49,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:25:49,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:25:49,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:25:49,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:25:49,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:25:49,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:25:49,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:25:49,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:25:49,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:25:49,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:25:49,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:25:49,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:25:49,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:25:49,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:25:49,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:25:49,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:25:49,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:25:49,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:25:49,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:25:49,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:25:49,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:25:49,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:25:49,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:25:49,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:25:49,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:25:49,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:25:49,056 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:25:49,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:25:49,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:25:49,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:25:49,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:25:49,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:25:49,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:25:49,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:25:49,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:25:49,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:25:49,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:25:49,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:25:49,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:25:49,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:25:49,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:25:49,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:25:49,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:25:49,061 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-03 14:25:49,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:25:49,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:25:49,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:25:49,272 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:25:49,273 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:25:49,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1169.bpl [2022-10-03 14:25:49,275 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1169.bpl' [2022-10-03 14:25:49,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:25:49,350 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:25:49,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:25:49,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:25:49,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:25:49,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:25:49,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:25:49,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:25:49,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:25:49,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/1) ... [2022-10-03 14:25:49,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:25:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:25:49,528 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-03 14:25:49,560 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-03 14:25:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:25:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:25:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:25:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:25:49,576 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:25:49,723 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:25:49,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:25:50,565 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:25:50,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:25:50,589 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:25:50,591 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:25:50 BoogieIcfgContainer [2022-10-03 14:25:50,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:25:50,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:25:50,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:25:50,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:25:50,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:25:49" (1/2) ... [2022-10-03 14:25:50,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79c0bb and model type divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:25:50, skipping insertion in model container [2022-10-03 14:25:50,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:25:50" (2/2) ... [2022-10-03 14:25:50,601 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1169.bpl [2022-10-03 14:25:50,606 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:25:50,614 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:25:50,614 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:25:50,614 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:25:50,755 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:25:50,810 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:25:50,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:25:50,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:25:50,813 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-03 14:25:50,814 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-03 14:25:50,841 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:25:50,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:25:50,852 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;@7d204da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:25:50,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:25:51,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:25:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:25:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1290786773, now seen corresponding path program 1 times [2022-10-03 14:25:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:25:51,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556128349] [2022-10-03 14:25:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:25:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:25:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:25:51,511 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-03 14:25:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:25:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556128349] [2022-10-03 14:25:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556128349] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:25:51,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:25:51,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:25:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332702966] [2022-10-03 14:25:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:25:51,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:25:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:25:51,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:25:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:25:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:51,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:25:51,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 201.5) internal successors, (403), 2 states have internal predecessors, (403), 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-03 14:25:51,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:51,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:25:51,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:25:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:25:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash -48975802, now seen corresponding path program 1 times [2022-10-03 14:25:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:25:51,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637082801] [2022-10-03 14:25:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:25:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:25:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:25:52,650 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-03 14:25:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:25:52,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637082801] [2022-10-03 14:25:52,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637082801] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:25:52,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:25:52,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-10-03 14:25:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742169167] [2022-10-03 14:25:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:25:52,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-03 14:25:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:25:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-03 14:25:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-10-03 14:25:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:52,656 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:25:52,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 16.785714285714285) internal successors, (470), 29 states have internal predecessors, (470), 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-03 14:25:52,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:52,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:25:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:25:57,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:25:57,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:25:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:25:57,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1982213258, now seen corresponding path program 1 times [2022-10-03 14:25:57,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:25:57,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178518032] [2022-10-03 14:25:57,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:25:57,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:25:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:26:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19989 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 19753 trivial. 0 not checked. [2022-10-03 14:26:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:26:05,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178518032] [2022-10-03 14:26:05,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178518032] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:26:05,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:26:05,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-10-03 14:26:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911418482] [2022-10-03 14:26:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:26:05,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-10-03 14:26:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:26:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-10-03 14:26:05,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=5444, Unknown=0, NotChecked=0, Total=5700 [2022-10-03 14:26:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:05,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:26:05,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 16.17105263157895) internal successors, (1229), 76 states have internal predecessors, (1229), 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-03 14:26:05,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:05,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:26:05,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:26:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-10-03 14:26:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:26:27,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:26:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:26:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 606232320, now seen corresponding path program 2 times [2022-10-03 14:26:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:26:27,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316576371] [2022-10-03 14:26:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:26:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:26:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:26:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19818 backedges. 10912 proven. 2847 refuted. 0 times theorem prover too weak. 6059 trivial. 0 not checked. [2022-10-03 14:26:33,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:26:33,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316576371] [2022-10-03 14:26:33,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316576371] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:26:33,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819697069] [2022-10-03 14:26:33,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 14:26:33,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:26:33,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:26:33,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:26:33,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:26:35,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 14:26:35,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 14:26:35,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 11311 conjuncts, 82 conjunts are in the unsatisfiable core [2022-10-03 14:26:36,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:26:43,509 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 10 treesize of output 9 [2022-10-03 14:26:44,053 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 14:26:44,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 [2022-10-03 14:26:45,001 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-10-03 14:26:45,001 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 19 treesize of output 19 [2022-10-03 14:26:45,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:26:45,215 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 19 treesize of output 21 [2022-10-03 14:26:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19818 backedges. 10905 proven. 2841 refuted. 0 times theorem prover too weak. 6072 trivial. 0 not checked. [2022-10-03 14:26:45,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:26:45,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int))) (not (= |c_#memory_$Pointer$.base| (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1139)))) is different from false [2022-10-03 14:26:45,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:26:45,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:26:46,026 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 34 treesize of output 25 [2022-10-03 14:26:46,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:26:46,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:26:46,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((v_ArrVal_1139 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)))) is different from false [2022-10-03 14:26:46,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:26:46,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|))) is different from false [2022-10-03 14:26:46,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) is different from false [2022-10-03 14:26:46,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:26:46,169 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 30 treesize of output 29 [2022-10-03 14:26:46,172 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 9 treesize of output 7 [2022-10-03 14:26:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19818 backedges. 10865 proven. 2098 refuted. 0 times theorem prover too weak. 6072 trivial. 783 not checked. [2022-10-03 14:26:47,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819697069] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:26:47,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:26:47,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 36, 27] total 106 [2022-10-03 14:26:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405643262] [2022-10-03 14:26:47,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:26:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-10-03 14:26:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:26:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-10-03 14:26:47,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=8952, Unknown=13, NotChecked=1782, Total=11130 [2022-10-03 14:26:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:47,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:26:47,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 48.58490566037736) internal successors, (5150), 106 states have internal predecessors, (5150), 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-03 14:26:47,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:47,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:26:47,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-10-03 14:26:47,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:55,038 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_#in~self#1.base| 1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q_#1.base|) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|)) is different from false [2022-10-03 14:26:55,041 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|)) is different from false [2022-10-03 14:26:55,043 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)) is different from false [2022-10-03 14:26:56,250 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))))) is different from false [2022-10-03 14:26:58,317 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:26:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:26:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:26:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-10-03 14:26:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-10-03 14:26:59,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:26:59,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-10-03 14:26:59,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:26:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:26:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1088826285, now seen corresponding path program 1 times [2022-10-03 14:26:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:26:59,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380446768] [2022-10-03 14:26:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:26:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6018 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 5772 trivial. 0 not checked. [2022-10-03 14:27:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:05,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380446768] [2022-10-03 14:27:05,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380446768] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:27:05,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:27:05,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-10-03 14:27:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211270249] [2022-10-03 14:27:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:27:05,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-10-03 14:27:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:27:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-10-03 14:27:05,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=6218, Unknown=0, NotChecked=0, Total=6480 [2022-10-03 14:27:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:05,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:27:05,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 15.333333333333334) internal successors, (1242), 81 states have internal predecessors, (1242), 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-03 14:27:05,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:05,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:27:05,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-10-03 14:27:05,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2022-10-03 14:27:05,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:27:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:27:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-10-03 14:27:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:27:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:27:28,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1642099893, now seen corresponding path program 2 times [2022-10-03 14:27:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:28,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184518989] [2022-10-03 14:27:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6243 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 5818 trivial. 0 not checked. [2022-10-03 14:27:34,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:34,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184518989] [2022-10-03 14:27:34,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184518989] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:27:34,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:27:34,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-10-03 14:27:34,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278088064] [2022-10-03 14:27:34,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:27:34,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-10-03 14:27:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:27:34,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-10-03 14:27:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6556, Unknown=0, NotChecked=0, Total=6806 [2022-10-03 14:27:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:34,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:27:34,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 16.313253012048193) internal successors, (1354), 83 states have internal predecessors, (1354), 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-03 14:27:34,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:34,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:27:34,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:27:34,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2022-10-03 14:27:34,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:27:34,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:28:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:28:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:28:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-03 14:28:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:28:04,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 14:28:04,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:28:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:28:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 112363561, now seen corresponding path program 3 times [2022-10-03 14:28:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:28:04,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978031921] [2022-10-03 14:28:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:28:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:28:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:28:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6018 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 5782 trivial. 0 not checked. [2022-10-03 14:28:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:28:10,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978031921] [2022-10-03 14:28:10,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978031921] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:28:10,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:28:10,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-10-03 14:28:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495408121] [2022-10-03 14:28:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:28:10,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-03 14:28:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:28:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-03 14:28:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=6068, Unknown=0, NotChecked=0, Total=6320 [2022-10-03 14:28:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:10,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:28:10,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 15.4) internal successors, (1232), 80 states have internal predecessors, (1232), 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-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2022-10-03 14:28:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-10-03 14:28:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-10-03 14:28:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 14:28:52,582 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:28:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:28:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -765349226, now seen corresponding path program 1 times [2022-10-03 14:28:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:28:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954718863] [2022-10-03 14:28:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:28:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:28:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:28:54,342 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-03 14:28:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:28:54,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954718863] [2022-10-03 14:28:54,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954718863] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:28:54,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:28:54,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-10-03 14:28:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885678029] [2022-10-03 14:28:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:28:54,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-10-03 14:28:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:28:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-10-03 14:28:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=4343, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 14:28:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:54,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:28:54,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 7.823529411764706) internal successors, (532), 68 states have internal predecessors, (532), 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-03 14:28:54,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:54,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:28:54,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-10-03 14:28:54,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:28:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:28:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 135 states. [2022-10-03 14:28:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2022-10-03 14:28:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:19,320 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_#in~self#1.base| 1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q_#1.base|) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|)) is different from false [2022-10-03 14:29:20,126 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_fifo_pop_~self#1.base| 1)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_1139 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1139) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))))) is different from false [2022-10-03 14:29:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:29:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:29:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-10-03 14:29:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-10-03 14:29:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:29:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-10-03 14:29:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-10-03 14:29:22,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 14:29:22,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:29:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:29:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1064126040, now seen corresponding path program 1 times [2022-10-03 14:29:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:29:22,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032328917] [2022-10-03 14:29:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:29:22,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:29:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:29:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23016 backedges. 1634 proven. 0 refuted. 0 times theorem prover too weak. 21382 trivial. 0 not checked. [2022-10-03 14:29:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:29:29,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032328917] [2022-10-03 14:29:29,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032328917] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:29:29,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:29:29,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 14:29:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981328973] [2022-10-03 14:29:29,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:29:29,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 14:29:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:29:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 14:29:29,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5315, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 14:29:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:29,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:29:29,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 17.266666666666666) internal successors, (1295), 75 states have internal predecessors, (1295), 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-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 202 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2022-10-03 14:29:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-10-03 14:29:29,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-10-03 14:29:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:29:47,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 14:29:47,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:29:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:29:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash -476411297, now seen corresponding path program 1 times [2022-10-03 14:29:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:29:47,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375447743] [2022-10-03 14:29:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:29:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:29:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:29:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22127 backedges. 2162 proven. 0 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2022-10-03 14:29:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:29:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375447743] [2022-10-03 14:29:55,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375447743] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:29:55,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:29:55,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-10-03 14:29:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629845374] [2022-10-03 14:29:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:29:55,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-10-03 14:29:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:29:55,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-10-03 14:29:55,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=6536, Unknown=0, NotChecked=0, Total=6806 [2022-10-03 14:29:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:55,129 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:29:55,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 16.16867469879518) internal successors, (1342), 83 states have internal predecessors, (1342), 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-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 204 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2022-10-03 14:29:55,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-10-03 14:29:55,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:29:55,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-10-03 14:30:18,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-03 14:30:18,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:30:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:30:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1174855119, now seen corresponding path program 1 times [2022-10-03 14:30:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:30:18,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017784044] [2022-10-03 14:30:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:18,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:30:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:30:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:30:19,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017784044] [2022-10-03 14:30:19,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017784044] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:30:19,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520971086] [2022-10-03 14:30:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:30:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:30:19,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:30:19,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:30:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:20,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 2104 conjuncts, 211 conjunts are in the unsatisfiable core [2022-10-03 14:30:20,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:30:20,678 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-03 14:30:21,275 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-03 14:30:21,278 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-03 14:30:21,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:21,553 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 32 treesize of output 25 [2022-10-03 14:30:21,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:21,556 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-03 14:30:23,269 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:30:23,269 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-03 14:30:23,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:23,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-03 14:30:23,821 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 42 treesize of output 38 [2022-10-03 14:30:23,826 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 29 treesize of output 27 [2022-10-03 14:30:28,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:28,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:30:28,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-10-03 14:30:29,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:30:29,248 INFO L356 Elim1Store]: treesize reduction 286, result has 45.1 percent of original size [2022-10-03 14:30:29,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 35 case distinctions, treesize of input 135 treesize of output 314 [2022-10-03 14:30:29,260 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 11 treesize of output 7 [2022-10-03 14:33:21,877 WARN L233 SmtUtils]: Spent 31.70s on a formula simplification. DAG size of input: 2589 DAG size of output: 2589 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-03 14:34:51,222 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 3323 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-03 14:35:16,065 WARN L233 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 2953 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-03 14:37:52,841 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 2941 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-03 14:38:57,387 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 2589 DAG size of output: 2589 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-10-03 14:39:51,235 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-10-03 14:39:51,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 14:39:51,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 14:39:51,269 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:39:51,269 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-03 14:39:51,269 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-03 14:39:51,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:39:51,452 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 871 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 15ms.. [2022-10-03 14:39:51,455 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-10-03 14:39:51,456 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 14:39:51,457 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 14:39:51,457 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 14:39:51,459 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1169.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:51 BasicIcfg [2022-10-03 14:39:51,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 14:39:51,460 INFO L158 Benchmark]: Toolchain (without parser) took 842109.93ms. Allocated memory was 169.9MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 124.6MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. [2022-10-03 14:39:51,460 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 169.9MB. Free memory was 131.3MB in the beginning and 131.2MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:39:51,460 INFO L158 Benchmark]: Boogie Preprocessor took 108.73ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 144.6MB in the end (delta: -20.0MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-10-03 14:39:51,460 INFO L158 Benchmark]: RCFGBuilder took 1129.91ms. Allocated memory is still 169.9MB. Free memory was 144.4MB in the beginning and 111.3MB in the end (delta: 33.2MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. [2022-10-03 14:39:51,460 INFO L158 Benchmark]: TraceAbstraction took 840866.79ms. Allocated memory was 169.9MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 110.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. [2022-10-03 14:39:51,461 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.13ms. Allocated memory is still 169.9MB. Free memory was 131.3MB in the beginning and 131.2MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 108.73ms. Allocated memory is still 169.9MB. Free memory was 124.6MB in the beginning and 144.6MB in the end (delta: -20.0MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1129.91ms. Allocated memory is still 169.9MB. Free memory was 144.4MB in the beginning and 111.3MB in the end (delta: 33.2MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. * TraceAbstraction took 840866.79ms. Allocated memory was 169.9MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 110.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 189, positive: 178, positive conditional: 178, 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: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 11, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 819, positive: 792, positive conditional: 792, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 792, Positive conditional cache size: 0, Positive unconditional cache size: 792, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 38, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 42218, positive: 40972, positive conditional: 40972, positive unconditional: 0, negative: 1246, negative conditional: 1246, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 38630, Positive cache size: 38542, Positive conditional cache size: 0, Positive unconditional cache size: 38542, Negative cache size: 88, Negative conditional cache size: 0, Negative unconditional cache size: 88, Independence queries for same thread: 1195, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 50501, positive: 48963, positive conditional: 48963, positive unconditional: 0, negative: 1538, negative conditional: 1538, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 62526, Positive cache size: 62357, Positive conditional cache size: 0, Positive unconditional cache size: 62357, Negative cache size: 169, Negative conditional cache size: 0, Negative unconditional cache size: 169, Independence queries for same thread: 2613, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 17348, positive: 16820, positive conditional: 16820, positive unconditional: 0, negative: 528, negative conditional: 528, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 66887, Positive cache size: 66708, Positive conditional cache size: 0, Positive unconditional cache size: 66708, Negative cache size: 179, Negative conditional cache size: 0, Negative unconditional cache size: 179, Independence queries for same thread: 3125, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 17615, positive: 17068, positive conditional: 17068, positive unconditional: 0, negative: 547, negative conditional: 547, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 67121, Positive cache size: 66941, Positive conditional cache size: 0, Positive unconditional cache size: 66941, Negative cache size: 180, Negative conditional cache size: 0, Negative unconditional cache size: 180, Independence queries for same thread: 3655, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 18297, positive: 17739, positive conditional: 17739, positive unconditional: 0, negative: 558, negative conditional: 558, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 67722, Positive cache size: 67539, Positive conditional cache size: 0, Positive unconditional cache size: 67539, Negative cache size: 183, Negative conditional cache size: 0, Negative unconditional cache size: 183, Independence queries for same thread: 4193, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 21860, positive: 20929, positive conditional: 20929, positive unconditional: 0, negative: 931, negative conditional: 931, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 75444, Positive cache size: 75197, Positive conditional cache size: 0, Positive unconditional cache size: 75197, Negative cache size: 247, Negative conditional cache size: 0, Negative unconditional cache size: 247, Independence queries for same thread: 4982, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19304, positive: 18720, positive conditional: 18720, positive unconditional: 0, negative: 584, negative conditional: 584, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 77360, Positive cache size: 77106, Positive conditional cache size: 0, Positive unconditional cache size: 77106, Negative cache size: 254, Negative conditional cache size: 0, Negative unconditional cache size: 254, Independence queries for same thread: 5536, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 18855, positive: 18286, positive conditional: 18286, positive unconditional: 0, negative: 569, negative conditional: 569, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 78043, Positive cache size: 77786, Positive conditional cache size: 0, Positive unconditional cache size: 77786, Negative cache size: 257, Negative conditional cache size: 0, Negative unconditional cache size: 257, Independence queries for same thread: 6076, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3670, positive: 3547, positive conditional: 3547, positive unconditional: 0, negative: 123, negative conditional: 123, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 210676, positive: 204014, positive conditional: 204014, positive unconditional: 0, negative: 6662, negative conditional: 6662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204477, positive: 204014, positive conditional: 0, positive unconditional: 204014, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 78069, positive: 77812, positive conditional: 0, positive unconditional: 77812, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 204477, positive: 126202, positive conditional: 0, positive unconditional: 126202, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 78069, unknown conditional: 0, unknown unconditional: 78069] , Statistics on independence cache: Total cache size (in pairs): 78069, Positive cache size: 77812, Positive conditional cache size: 0, Positive unconditional cache size: 77812, Negative cache size: 257, Negative conditional cache size: 0, Negative unconditional cache size: 257, Independence queries for same thread: 6199, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1169]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 871 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1463 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 840.7s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 205.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 8.5s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 34339 NumberOfCodeBlocks, 34339 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 38882 ConstructedInterpolants, 332 QuantifiedInterpolants, 180841 SizeOfPredicates, 53 NumberOfNonLiveVariables, 11311 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 134296/142865 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