/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_1w1r.line1266.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:19:40,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:19:40,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:19:40,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:19:40,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:19:40,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:19:40,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:19:40,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:19:40,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:19:40,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:19:40,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:19:40,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:19:40,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:19:40,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:19:40,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:19:40,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:19:40,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:19:40,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:19:40,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:19:40,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:19:40,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:19:40,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:19:40,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:19:40,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:19:40,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:19:40,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:19:40,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:19:40,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:19:40,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:19:40,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:19:40,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:19:40,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:19:40,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:19:40,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:19:40,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:19:40,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:19:40,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:19:40,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:19:40,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:19:40,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:19:40,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:19:40,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:19:40,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:19:40,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:19:40,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:19:40,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:19:40,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:19:40,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:19:40,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:19:40,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:19:40,945 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:19:40,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:19:40,945 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:19:40,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:19:40,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:19:40,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:19:40,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:19:40,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:19:40,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:19:40,949 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:19:40,949 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:19:40,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:19:40,949 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 15:19:41,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:19:41,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:19:41,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:19:41,180 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:19:41,181 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:19:41,182 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_1w1r.line1266.bpl [2022-10-03 15:19:41,182 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1266.bpl' [2022-10-03 15:19:41,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:19:41,265 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:19:41,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:19:41,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:19:41,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:19:41,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:19:41,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:19:41,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:19:41,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:19:41,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/1) ... [2022-10-03 15:19:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:19:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:19:41,411 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 15:19:41,423 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 15:19:41,437 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:19:41,437 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:19:41,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:19:41,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:19:41,438 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 15:19:41,547 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:19:41,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:19:42,418 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:19:42,445 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:19:42,446 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:19:42,449 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:19:42 BoogieIcfgContainer [2022-10-03 15:19:42,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:19:42,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:19:42,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:19:42,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:19:42,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:19:41" (1/2) ... [2022-10-03 15:19:42,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2389950c and model type divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:19:42, skipping insertion in model container [2022-10-03 15:19:42,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:19:42" (2/2) ... [2022-10-03 15:19:42,459 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1266.bpl [2022-10-03 15:19:42,464 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:19:42,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:19:42,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:19:42,472 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:19:42,634 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:19:42,695 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:19:42,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:19:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:19:42,697 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 15:19:42,725 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 15:19:42,739 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:19:42,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:19:42,757 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;@28068f4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:19:42,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:19:43,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:19:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:19:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 837661700, now seen corresponding path program 1 times [2022-10-03 15:19:43,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:19:43,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836116571] [2022-10-03 15:19:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:19:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:19:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:19:43,546 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 15:19:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:19:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836116571] [2022-10-03 15:19:43,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836116571] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:19:43,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:19:43,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:19:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117903398] [2022-10-03 15:19:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:19:43,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:19:43,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:19:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:19:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:19:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:43,580 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:19:43,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 239.5) internal successors, (479), 2 states have internal predecessors, (479), 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 15:19:43,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:19:43,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:19:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:19:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1626385338, now seen corresponding path program 1 times [2022-10-03 15:19:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:19:43,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102621503] [2022-10-03 15:19:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:19:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:19:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:19:44,269 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 15:19:44,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:19:44,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102621503] [2022-10-03 15:19:44,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102621503] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:19:44,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:19:44,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-10-03 15:19:44,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488169547] [2022-10-03 15:19:44,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:19:44,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-03 15:19:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:19:44,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-03 15:19:44,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2022-10-03 15:19:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:44,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:19:44,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 32.11764705882353) internal successors, (546), 18 states have internal predecessors, (546), 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 15:19:44,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:44,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:19:46,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:19:46,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:19:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:19:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1182254140, now seen corresponding path program 1 times [2022-10-03 15:19:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:19:46,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63133075] [2022-10-03 15:19:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:19:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:19:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:19:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-03 15:19:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:19:50,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63133075] [2022-10-03 15:19:50,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63133075] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:19:50,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:19:50,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-10-03 15:19:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610487050] [2022-10-03 15:19:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:19:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-10-03 15:19:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:19:50,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-10-03 15:19:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2022-10-03 15:19:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:50,167 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:19:50,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 12.106060606060606) internal successors, (799), 66 states have internal predecessors, (799), 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 15:19:50,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:19:50,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:19:50,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:20:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:20:08,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:20:08,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1292703744, now seen corresponding path program 1 times [2022-10-03 15:20:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:08,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352466734] [2022-10-03 15:20:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:08,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-03 15:20:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:10,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352466734] [2022-10-03 15:20:10,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352466734] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:10,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:10,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 15:20:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513675682] [2022-10-03 15:20:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 15:20:10,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 15:20:10,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3592, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 15:20:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:10,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:10,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 13.580645161290322) internal successors, (842), 62 states have internal predecessors, (842), 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 15:20:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:20:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:20:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:20:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:20:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:20:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:20:22,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash -765769323, now seen corresponding path program 1 times [2022-10-03 15:20:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:22,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884230744] [2022-10-03 15:20:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:25,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884230744] [2022-10-03 15:20:25,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884230744] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:25,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:25,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 15:20:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975647989] [2022-10-03 15:20:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:25,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 15:20:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 15:20:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5315, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 15:20:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:25,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:25,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 10.333333333333334) internal successors, (775), 75 states have internal predecessors, (775), 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 15:20:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:20:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:20:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:20:25,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:20:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:20:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:20:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 15:20:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:20:43,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1123883743, now seen corresponding path program 1 times [2022-10-03 15:20:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:43,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068534900] [2022-10-03 15:20:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068534900] [2022-10-03 15:20:45,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068534900] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:45,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:45,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2022-10-03 15:20:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767206879] [2022-10-03 15:20:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:45,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-10-03 15:20:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-10-03 15:20:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5767, Unknown=0, NotChecked=0, Total=6006 [2022-10-03 15:20:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:46,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:46,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 8.961538461538462) internal successors, (699), 78 states have internal predecessors, (699), 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 15:20:46,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:46,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:20:46,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:20:46,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:20:46,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 15:20:46,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:21:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:21:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:21:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:21:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 15:21:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 15:21:12,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash -860496070, now seen corresponding path program 1 times [2022-10-03 15:21:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:12,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726447657] [2022-10-03 15:21:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 217 proven. 182 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-03 15:21:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726447657] [2022-10-03 15:21:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726447657] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:21:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798478183] [2022-10-03 15:21:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:15,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:21:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:21:15,864 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 15:21:15,865 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 15:21:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:16,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 178 conjunts are in the unsatisfiable core [2022-10-03 15:21:16,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:21:16,561 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 15:21:16,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:21:16,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:21:17,359 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:21:17,359 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 15:21:17,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:21:20,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:21:20,546 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 21 treesize of output 25 [2022-10-03 15:21:21,634 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:21:21,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-10-03 15:21:21,641 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 31 treesize of output 29 [2022-10-03 15:21:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 272 proven. 124 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-03 15:21:22,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:21:23,276 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_508) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_507) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:21:23,308 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_508) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_507) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:21:23,321 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_508) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_507) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:21:26,565 INFO L356 Elim1Store]: treesize reduction 13, result has 86.6 percent of original size [2022-10-03 15:21:26,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 141 [2022-10-03 15:21:26,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-10-03 15:21:26,631 INFO L356 Elim1Store]: treesize reduction 13, result has 86.6 percent of original size [2022-10-03 15:21:26,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 137 [2022-10-03 15:21:26,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-10-03 15:21:29,448 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:21:29,449 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 13 treesize of output 12 [2022-10-03 15:21:32,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_506 Int) (v_ArrVal_505 Int)) (or (= |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (< (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_505) |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#q~1#1.base|) 16))))) is different from false [2022-10-03 15:23:10,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:23:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 93 proven. 112 refuted. 0 times theorem prover too weak. 216 trivial. 12 not checked. [2022-10-03 15:23:10,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798478183] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:23:10,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:23:10,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 57, 47] total 194 [2022-10-03 15:23:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078284547] [2022-10-03 15:23:10,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:23:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 194 states [2022-10-03 15:23:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:23:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2022-10-03 15:23:10,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=922, Invalid=34966, Unknown=38, NotChecked=1516, Total=37442 [2022-10-03 15:23:10,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:23:10,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:23:10,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 194 states, 194 states have (on average 14.860824742268042) internal successors, (2883), 194 states have internal predecessors, (2883), 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 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-10-03 15:23:10,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:23:17,142 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 50 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:23:25,381 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 36 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:24:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:24:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:24:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:24:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:24:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:24:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:24:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2022-10-03 15:24:59,908 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 15:25:00,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-03 15:25:00,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:25:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:25:00,089 INFO L85 PathProgramCache]: Analyzing trace with hash -930973753, now seen corresponding path program 1 times [2022-10-03 15:25:00,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:25:00,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740133325] [2022-10-03 15:25:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:25:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:25:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:25:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-10-03 15:25:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:25:00,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740133325] [2022-10-03 15:25:00,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740133325] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:25:00,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:25:00,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:25:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805629934] [2022-10-03 15:25:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:25:00,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:25:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:25:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:25:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:25:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:25:00,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:25:00,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.04761904761905) internal successors, (778), 21 states have internal predecessors, (778), 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 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 273 states. [2022-10-03 15:25:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:25:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:25:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 15:25:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:25:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:25:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:25:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:25:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2022-10-03 15:25:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:25:20,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 15:25:20,911 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:25:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:25:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 916642484, now seen corresponding path program 1 times [2022-10-03 15:25:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:25:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860480830] [2022-10-03 15:25:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:25:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:25:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:25:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4177 backedges. 972 proven. 3033 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-10-03 15:25:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:25:31,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860480830] [2022-10-03 15:25:31,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860480830] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:25:31,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937477503] [2022-10-03 15:25:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:25:31,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:25:31,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:25:31,767 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 15:25:31,768 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 15:25:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:25:33,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 6205 conjuncts, 291 conjunts are in the unsatisfiable core [2022-10-03 15:25:33,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:25:34,997 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 15:25:36,825 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:25:36,826 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 15:25:37,266 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 15:25:40,305 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:25:40,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 32 [2022-10-03 15:25:42,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 15:25:44,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:25:44,292 INFO L356 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-10-03 15:25:44,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 42 [2022-10-03 15:25:47,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-10-03 15:25:48,175 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 12 treesize of output 11 [2022-10-03 15:25:52,286 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:25:52,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 43 [2022-10-03 15:25:57,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:25:57,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-10-03 15:25:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4177 backedges. 3339 proven. 254 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2022-10-03 15:25:57,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:26:01,919 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 32 treesize of output 19 [2022-10-03 15:26:02,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_795)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select (select (store .cse2 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)))))) is different from false [2022-10-03 15:26:02,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_795)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store .cse2 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 15:26:02,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_795)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 15:26:02,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_795)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 15:26:02,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_795)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 15:26:02,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_795)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (not (= (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))))) is different from false [2022-10-03 15:26:02,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store .cse2 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_795)))) (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse2 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)))))))) is different from false [2022-10-03 15:26:02,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store .cse0 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_795)))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select .cse0 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (select (select (store .cse1 .cse2 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)))))))) is different from false [2022-10-03 15:26:02,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset| v_ArrVal_795)))) (let ((.cse3 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (not (= .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) is different from false [2022-10-03 15:26:03,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base| (store .cse2 |c_ULTIMATE.start_fifo_front_#in~self#1.offset| v_ArrVal_795)))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= (select .cse2 |c_ULTIMATE.start_fifo_front_#in~self#1.offset|) (select (select (store .cse3 .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 15:26:03,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse1 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse1)) .cse1 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 15:26:03,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse3 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse3 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:03,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 154 [2022-10-03 15:26:03,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (store .cse4 v_arrayElimCell_39 (select .cse4 v_arrayElimCell_39))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:04,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_791))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:05,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse6 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_790))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_791)))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:05,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse6 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_790))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_791)))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select (select (let ((.cse2 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:05,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_790))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_791)))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:05,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539| Int) (v_arrayElimCell_39 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_790))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_791)))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_read~$Pointer$_#ptr#1.base_539|) |v_ULTIMATE.start_read~$Pointer$_#ptr#1.offset_467|))) (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 v_arrayElimCell_39 (select .cse5 v_arrayElimCell_39)))))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (let ((.cse2 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (store (store .cse1 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse2)) .cse2 v_ArrVal_797)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 15:26:08,550 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:26:08,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1119 treesize of output 667 [2022-10-03 15:26:08,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:26:08,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 122750 treesize of output 108470 [2022-10-03 15:26:09,527 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 108230 treesize of output 104774 [2022-10-03 15:26:09,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:26:09,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144262 treesize of output 119494 [2022-10-03 15:26:15,286 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 811 DAG size of output: 809 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-10-03 15:26:15,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:26:15,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 125940 treesize of output 115196 [2022-10-03 15:26:18,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-10-03 15:26:20,867 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 6 treesize of output 4 [2022-10-03 15:26:21,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:26:21,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 27 [2022-10-03 15:26:21,639 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 6 treesize of output 4 Received shutdown request... [2022-10-03 15:34:05,588 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:34:05,619 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 15:34:05,619 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 15:34:05,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 15:34:05,621 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 15:34:05,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:34:05,817 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 2582 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-10-03 15:34:05,822 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-03 15:34:05,823 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:34:05,825 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:34:05,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:34:05,826 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1266.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:34:05 BasicIcfg [2022-10-03 15:34:05,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:34:05,827 INFO L158 Benchmark]: Toolchain (without parser) took 864561.51ms. Allocated memory was 168.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 114.9MB in the beginning and 395.9MB in the end (delta: -281.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-03 15:34:05,827 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:34:05,827 INFO L158 Benchmark]: Boogie Preprocessor took 116.31ms. Allocated memory is still 168.8MB. Free memory was 114.9MB in the beginning and 108.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:34:05,827 INFO L158 Benchmark]: RCFGBuilder took 1059.86ms. Allocated memory was 168.8MB in the beginning and 230.7MB in the end (delta: 61.9MB). Free memory was 108.5MB in the beginning and 135.7MB in the end (delta: -27.2MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. [2022-10-03 15:34:05,828 INFO L158 Benchmark]: TraceAbstraction took 863375.18ms. Allocated memory was 230.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 135.2MB in the beginning and 395.9MB in the end (delta: -260.7MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-10-03 15:34:05,828 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.10ms. Allocated memory is still 168.8MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 116.31ms. Allocated memory is still 168.8MB. Free memory was 114.9MB in the beginning and 108.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1059.86ms. Allocated memory was 168.8MB in the beginning and 230.7MB in the end (delta: 61.9MB). Free memory was 108.5MB in the beginning and 135.7MB in the end (delta: -27.2MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. * TraceAbstraction took 863375.18ms. Allocated memory was 230.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 135.2MB in the beginning and 395.9MB in the end (delta: -260.7MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 267, positive: 257, positive conditional: 257, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 897, positive: 869, positive conditional: 869, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 871, Positive cache size: 871, Positive conditional cache size: 0, Positive unconditional cache size: 871, 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: 2768, positive: 2679, positive conditional: 2679, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 1993, Positive cache size: 1993, Positive conditional cache size: 0, Positive unconditional cache size: 1993, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 127, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2959, positive: 2865, positive conditional: 2865, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 2635, Positive cache size: 2634, Positive conditional cache size: 0, Positive unconditional cache size: 2634, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 220, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2523, positive: 2441, positive conditional: 2441, positive unconditional: 0, negative: 82, negative conditional: 82, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 2759, Positive cache size: 2758, Positive conditional cache size: 0, Positive unconditional cache size: 2758, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 302, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2117, positive: 2047, positive conditional: 2047, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 2780, Positive cache size: 2779, Positive conditional cache size: 0, Positive unconditional cache size: 2779, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 372, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4823, positive: 4665, positive conditional: 4665, positive unconditional: 0, negative: 158, negative conditional: 158, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 2987, Positive cache size: 2986, Positive conditional cache size: 0, Positive unconditional cache size: 2986, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 530, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4255, positive: 4114, positive conditional: 4114, positive unconditional: 0, negative: 141, negative conditional: 141, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 3207, Positive cache size: 3206, Positive conditional cache size: 0, Positive unconditional cache size: 3206, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 671, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11596, positive: 11218, positive conditional: 11218, positive unconditional: 0, negative: 378, negative conditional: 378, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32205, positive: 31155, positive conditional: 31155, positive unconditional: 0, negative: 1050, negative conditional: 1050, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31161, positive: 31155, positive conditional: 0, positive unconditional: 31155, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5543, positive: 5537, positive conditional: 0, positive unconditional: 5537, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31161, positive: 25618, positive conditional: 0, positive unconditional: 25618, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5543, unknown conditional: 0, unknown unconditional: 5543] , Statistics on independence cache: Total cache size (in pairs): 5543, Positive cache size: 5537, Positive conditional cache size: 0, Positive unconditional cache size: 5537, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 1044, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 2582 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 863.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 206.6s, 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: 895, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 129.4s InterpolantComputationTime, 7725 NumberOfCodeBlocks, 7725 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 8926 ConstructedInterpolants, 244 QuantifiedInterpolants, 101785 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2953 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1441/1871 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