/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.line1583.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 22:49:41,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 22:49:41,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 22:49:41,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 22:49:41,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 22:49:41,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 22:49:41,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 22:49:41,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 22:49:41,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 22:49:41,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 22:49:41,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 22:49:41,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 22:49:41,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 22:49:41,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 22:49:41,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 22:49:41,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 22:49:41,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 22:49:41,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 22:49:41,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 22:49:41,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 22:49:41,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 22:49:41,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 22:49:41,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 22:49:41,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 22:49:41,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 22:49:41,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 22:49:41,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 22:49:41,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 22:49:41,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 22:49:41,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 22:49:41,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 22:49:41,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 22:49:41,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 22:49:41,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 22:49:41,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 22:49:41,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 22:49:41,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 22:49:41,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 22:49:41,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 22:49:41,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 22:49:41,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 22:49:41,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 22:49:41,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 22:49:41,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 22:49:41,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 22:49:41,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 22:49:41,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 22:49:41,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 22:49:41,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 22:49:41,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 22:49:41,889 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 22:49:41,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 22:49:41,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 22:49:41,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:49:41,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 22:49:41,891 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 22:49:41,892 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 22:49:41,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 22:49:41,892 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 22:49:41,892 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 22:49:41,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 22:49:41,892 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-29 22:49:42,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 22:49:42,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 22:49:42,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 22:49:42,067 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 22:49:42,068 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 22:49:42,068 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.line1583.bpl [2022-09-29 22:49:42,069 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1583.bpl' [2022-09-29 22:49:42,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 22:49:42,136 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 22:49:42,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 22:49:42,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 22:49:42,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 22:49:42,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 22:49:42,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 22:49:42,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 22:49:42,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 22:49:42,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/1) ... [2022-09-29 22:49:42,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:49:42,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:49:42,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-29 22:49:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-29 22:49:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 22:49:42,312 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 22:49:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 22:49:42,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 22:49:42,314 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 22:49:42,499 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 22:49:42,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 22:49:43,295 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 22:49:43,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 22:49:43,322 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 22:49:43,326 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:49:43 BoogieIcfgContainer [2022-09-29 22:49:43,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 22:49:43,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 22:49:43,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 22:49:43,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 22:49:43,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:49:42" (1/2) ... [2022-09-29 22:49:43,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8061f7 and model type divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 10:49:43, skipping insertion in model container [2022-09-29 22:49:43,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:49:43" (2/2) ... [2022-09-29 22:49:43,333 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1583.bpl [2022-09-29 22:49:43,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 22:49:43,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 22:49:43,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 22:49:43,344 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 22:49:43,442 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 22:49:43,491 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:49:43,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:49:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:49:43,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 22:49:43,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-29 22:49:43,516 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:49:43,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 22:49:43,525 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;@2114498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:49:43,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:49:43,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:49:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:49:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash -441839634, now seen corresponding path program 1 times [2022-09-29 22:49:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:49:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636413602] [2022-09-29 22:49:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:49:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:49:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:49:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:49:44,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:49:44,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636413602] [2022-09-29 22:49:44,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636413602] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:49:44,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:49:44,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 22:49:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422656355] [2022-09-29 22:49:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:49:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 22:49:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:49:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 22:49:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 22:49:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:44,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:49:44,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:49:44,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:44,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 22:49:44,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:49:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:49:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1403365058, now seen corresponding path program 1 times [2022-09-29 22:49:44,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:49:44,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458281584] [2022-09-29 22:49:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:49:44,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:49:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:49:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:49:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:49:45,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458281584] [2022-09-29 22:49:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458281584] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:49:45,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:49:45,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-29 22:49:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491620183] [2022-09-29 22:49:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:49:45,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-29 22:49:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:49:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-29 22:49:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-09-29 22:49:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:45,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:49:45,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 60.84615384615385) internal successors, (791), 14 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:49:45,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:45,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:49:46,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 22:49:46,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:49:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:49:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1750863210, now seen corresponding path program 1 times [2022-09-29 22:49:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:49:46,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272882703] [2022-09-29 22:49:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:49:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:49:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:49:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2022-09-29 22:49:50,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:49:50,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272882703] [2022-09-29 22:49:50,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272882703] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:49:50,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:49:50,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-09-29 22:49:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106638337] [2022-09-29 22:49:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:49:50,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-09-29 22:49:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:49:50,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-09-29 22:49:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=5018, Unknown=0, NotChecked=0, Total=5256 [2022-09-29 22:49:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:50,884 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:49:50,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 13.150684931506849) internal successors, (960), 73 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:49:50,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:49:50,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:49:50,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:50:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-09-29 22:50:13,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-29 22:50:13,889 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:50:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:50:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash -228053806, now seen corresponding path program 2 times [2022-09-29 22:50:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:50:13,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326161949] [2022-09-29 22:50:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:50:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:50:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:50:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 3757 proven. 3075 refuted. 0 times theorem prover too weak. 8868 trivial. 0 not checked. [2022-09-29 22:50:20,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:50:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326161949] [2022-09-29 22:50:20,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326161949] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:50:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485644530] [2022-09-29 22:50:20,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-29 22:50:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:50:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:50:20,307 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-09-29 22:50:20,307 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-09-29 22:50:20,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-29 22:50:20,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-29 22:50:20,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 2006 conjuncts, 141 conjunts are in the unsatisfiable core [2022-09-29 22:50:20,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:50:22,677 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-09-29 22:50:22,678 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 40 [2022-09-29 22:50:22,691 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-29 22:50:22,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2022-09-29 22:50:22,703 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 9 treesize of output 3 [2022-09-29 22:50:23,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-09-29 22:50:23,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:50:23,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-09-29 22:50:23,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:50:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 2800 proven. 0 refuted. 0 times theorem prover too weak. 12900 trivial. 0 not checked. [2022-09-29 22:50:23,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:50:23,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485644530] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:50:23,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:50:23,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [64] total 95 [2022-09-29 22:50:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557578314] [2022-09-29 22:50:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:50:23,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-09-29 22:50:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:50:23,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-09-29 22:50:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=8624, Unknown=0, NotChecked=0, Total=8930 [2022-09-29 22:50:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:23,852 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:50:23,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 32.48717948717949) internal successors, (1267), 39 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:50:23,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:23,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:50:23,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-09-29 22:50:23,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:50:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-09-29 22:50:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:50:35,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-29 22:50:35,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-09-29 22:50:35,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:50:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:50:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1048677916, now seen corresponding path program 1 times [2022-09-29 22:50:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:50:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793348216] [2022-09-29 22:50:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:50:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:50:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:50:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 11187 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 11139 trivial. 0 not checked. [2022-09-29 22:50:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:50:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793348216] [2022-09-29 22:50:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793348216] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:50:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332269375] [2022-09-29 22:50:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:50:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:50:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:50:41,626 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-09-29 22:50:41,627 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-09-29 22:50:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:50:42,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 9506 conjuncts, 143 conjunts are in the unsatisfiable core [2022-09-29 22:50:43,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:50:43,576 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 6 treesize of output 5 [2022-09-29 22:50:44,596 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:50:44,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-29 22:50:44,930 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 20 treesize of output 20 [2022-09-29 22:50:47,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:50:47,316 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 32 treesize of output 23 [2022-09-29 22:50:47,601 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-09-29 22:50:48,106 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 21 treesize of output 9 [2022-09-29 22:50:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11187 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 11115 trivial. 0 not checked. [2022-09-29 22:50:48,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:50:48,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332269375] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:50:48,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:50:48,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [72] total 118 [2022-09-29 22:50:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630177265] [2022-09-29 22:50:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:50:48,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-29 22:50:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:50:48,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-29 22:50:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=13423, Unknown=0, NotChecked=0, Total=13806 [2022-09-29 22:50:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:48,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:50:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 20.666666666666668) internal successors, (992), 48 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:50:48,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:50:48,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:50:48,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-09-29 22:50:48,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:50:48,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:51:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-09-29 22:51:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:51:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-09-29 22:51:03,040 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-09-29 22:51:03,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:51:03,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:51:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:51:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1069246006, now seen corresponding path program 2 times [2022-09-29 22:51:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:51:03,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746994106] [2022-09-29 22:51:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:51:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:51:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:51:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11808 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 11331 trivial. 0 not checked. [2022-09-29 22:51:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:51:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746994106] [2022-09-29 22:51:10,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746994106] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:51:10,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:51:10,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-09-29 22:51:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244111266] [2022-09-29 22:51:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:51:10,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-09-29 22:51:10,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:51:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-09-29 22:51:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=6382, Unknown=0, NotChecked=0, Total=6642 [2022-09-29 22:51:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:10,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:51:10,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 13.365853658536585) internal successors, (1096), 82 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:51:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:51:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-09-29 22:51:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:51:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2022-09-29 22:51:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:51:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-09-29 22:51:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:51:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:51:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-09-29 22:51:42,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-29 22:51:42,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:51:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:51:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1253943348, now seen corresponding path program 3 times [2022-09-29 22:51:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:51:42,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091968464] [2022-09-29 22:51:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:51:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:51:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:51:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11187 trivial. 0 not checked. [2022-09-29 22:51:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:51:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091968464] [2022-09-29 22:51:46,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091968464] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:51:46,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:51:46,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-09-29 22:51:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114509604] [2022-09-29 22:51:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:51:46,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-09-29 22:51:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:51:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-09-29 22:51:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3828, Unknown=0, NotChecked=0, Total=4032 [2022-09-29 22:51:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:46,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:51:46,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 15.21875) internal successors, (974), 64 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-09-29 22:51:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:52:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-09-29 22:52:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:52:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-09-29 22:52:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:52:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-09-29 22:52:04,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-29 22:52:04,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:52:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:52:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1561638935, now seen corresponding path program 1 times [2022-09-29 22:52:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:52:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285292872] [2022-09-29 22:52:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:52:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:52:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:52:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10724 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2022-09-29 22:52:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:52:09,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285292872] [2022-09-29 22:52:09,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285292872] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:52:09,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:52:09,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-09-29 22:52:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095675619] [2022-09-29 22:52:09,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:52:09,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-09-29 22:52:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:52:09,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-09-29 22:52:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2022-09-29 22:52:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:09,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:52:09,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 14.219178082191782) internal successors, (1038), 73 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:52:09,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-09-29 22:52:09,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:52:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-09-29 22:52:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:52:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-09-29 22:52:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:52:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-09-29 22:52:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-09-29 22:52:30,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-29 22:52:30,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:52:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:52:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash -769675163, now seen corresponding path program 1 times [2022-09-29 22:52:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:52:30,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172336288] [2022-09-29 22:52:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:52:30,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:52:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:52:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12580 backedges. 1314 proven. 0 refuted. 0 times theorem prover too weak. 11266 trivial. 0 not checked. [2022-09-29 22:52:36,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:52:36,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172336288] [2022-09-29 22:52:36,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172336288] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:52:36,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:52:36,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-09-29 22:52:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915467326] [2022-09-29 22:52:36,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:52:36,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-29 22:52:36,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:52:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-29 22:52:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=6064, Unknown=0, NotChecked=0, Total=6320 [2022-09-29 22:52:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:36,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:52:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 13.325) internal successors, (1066), 80 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-09-29 22:52:36,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:53:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:53:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-29 22:53:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-09-29 22:53:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-09-29 22:53:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-09-29 22:53:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-09-29 22:53:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-09-29 22:53:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-09-29 22:53:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-09-29 22:53:05,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-29 22:53:05,481 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:53:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:53:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1898429688, now seen corresponding path program 1 times [2022-09-29 22:53:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:53:05,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972109565] [2022-09-29 22:53:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:53:05,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:53:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:53:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2022-09-29 22:53:05,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:53:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972109565] [2022-09-29 22:53:05,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972109565] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:53:05,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:53:05,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-29 22:53:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072135523] [2022-09-29 22:53:05,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:53:05,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-29 22:53:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:53:06,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-29 22:53:06,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-09-29 22:53:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:53:06,001 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:53:06,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 92.9090909090909) internal successors, (1022), 12 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 22:53:06,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:53:06,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-09-29 22:53:06,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-09-29 22:53:06,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-09-29 22:53:06,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-09-29 22:53:06,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-09-29 22:53:06,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-09-29 22:53:06,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-09-29 22:53:06,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 139 states. [2022-09-29 22:53:06,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:53:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-09-29 22:53:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-09-29 22:53:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-29 22:53:09,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-29 22:53:09,431 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:53:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:53:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1480334368, now seen corresponding path program 1 times [2022-09-29 22:53:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:53:09,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260743053] [2022-09-29 22:53:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:53:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:53:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:53:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16053 backedges. 1496 proven. 182 refuted. 0 times theorem prover too weak. 14375 trivial. 0 not checked. [2022-09-29 22:53:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:53:20,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260743053] [2022-09-29 22:53:20,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260743053] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:53:20,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713540662] [2022-09-29 22:53:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:53:20,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:53:20,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:53:20,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:53:20,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-29 22:53:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:53:22,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 11560 conjuncts, 382 conjunts are in the unsatisfiable core [2022-09-29 22:53:22,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:53:22,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:53:23,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:53:23,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-29 22:53:24,080 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:53:24,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-29 22:53:43,304 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:53:43,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-29 22:53:43,537 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-09-29 22:53:43,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2022-09-29 22:53:45,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:53:45,826 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 19 treesize of output 19 [2022-09-29 22:53:52,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:53:52,781 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 19 treesize of output 19 [2022-09-29 22:55:11,889 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-09-29 22:55:11,906 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-09-29 22:55:17,602 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-09-29 22:55:17,602 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 28 treesize of output 26 [2022-09-29 22:55:20,307 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-29 22:55:20,308 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 72 treesize of output 65 [2022-09-29 22:55:20,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:55:20,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 42 [2022-09-29 22:55:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16053 backedges. 2506 proven. 11591 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2022-09-29 22:55:22,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:55:23,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:55:23,000 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-09-29 22:55:23,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:55:23,004 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 1 case distinctions, treesize of input 12 treesize of output 8 [2022-09-29 22:55:25,318 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_4281)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_4281)) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (< .cse2 0))))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_4281)))) (or (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_4281)) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0)))))) is different from false [2022-09-29 22:55:25,410 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (let ((.cse1 (select .cse2 |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)))) (not (= (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< .cse4 0) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (= .cse4 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))))) is different from false [2022-09-29 22:55:25,456 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (< .cse1 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) is different from false [2022-09-29 22:55:25,535 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse1 (select .cse0 |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|)))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4)))))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4) (< .cse4 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))))) is different from false [2022-09-29 22:55:25,563 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse1 (select .cse0 |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|)))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4)))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse4) (< .cse4 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< v_ArrVal_4281 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4))))))))) is different from false [2022-09-29 22:55:25,652 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_4281 (+ (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (< .cse2 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse3 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_4281)))) (or (< v_ArrVal_4281 (+ (select .cse4 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)) (< (select (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_4282))) (or (not (= (select (select .cse6 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) is different from false [2022-09-29 22:55:25,733 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4281 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_4281)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (< .cse2 0) (< v_ArrVal_4281 (+ (select .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4)))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))) (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_4282))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base| (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse7 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_4281)))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse6 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (< v_ArrVal_4281 (+ (select .cse7 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4)))))))) is different from false [2022-09-29 22:55:25,798 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse0 (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_4282))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)) (let ((.cse1 (select .cse0 |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))))))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse3 .cse4 v_ArrVal_4281)))) (or (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (< v_ArrVal_4281 (+ (select .cse3 .cse4) 4)))))))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse11)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 (store .cse9 .cse10 v_ArrVal_4281)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= .cse6 (select .cse7 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse8 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))) (< .cse6 0) (< v_ArrVal_4281 (+ (select .cse9 .cse10) 4))))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (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_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))))) is different from false [2022-09-29 22:55:25,875 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_4282 (Array Int Int))) (not (= (select (select (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_4282) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (forall ((v_ArrVal_4281 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse0 .cse1 v_ArrVal_4281)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_4281 (+ (select .cse0 .cse1) 4)) (< .cse2 0) (= (select .cse3 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse2) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|))))))))))) (or (forall ((v_ArrVal_4281 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse9 (store .cse6 .cse7 v_ArrVal_4281)))) (or (< v_ArrVal_4281 (+ (select .cse6 .cse7) 4)) (< (select (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 0) (not (= |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset| (select (select .cse8 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|)))))))) (forall ((v_ArrVal_4282 (Array Int Int))) (let ((.cse11 (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_4282))) (or (let ((.cse10 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (not (= (select (select .cse11 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))))))) is different from false [2022-09-29 22:55:36,082 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-09-29 22:55:36,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 961 treesize of output 865 [2022-09-29 22:55:36,434 INFO L356 Elim1Store]: treesize reduction 30, result has 88.4 percent of original size [2022-09-29 22:55:36,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 6402 treesize of output 5762 [2022-09-29 22:55:36,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:55:36,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5165 treesize of output 4754 [2022-09-29 22:55:36,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:55:36,810 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 4465 treesize of output 4468 [2022-09-29 22:55:36,879 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 4449 treesize of output 4445 Received shutdown request... [2022-09-29 23:02:52,534 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-29 23:02:52,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 23:02:52,554 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 23:02:52,555 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 23:02:52,556 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 23:02:52,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-29 23:02:52,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:02:52,756 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 4539 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. [2022-09-29 23:02:52,760 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-09-29 23:02:52,761 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-09-29 23:02:52,762 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-29 23:02:52,762 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-29 23:02:52,764 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1583.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.09 11:02:52 BasicIcfg [2022-09-29 23:02:52,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-29 23:02:52,765 INFO L158 Benchmark]: Toolchain (without parser) took 790628.69ms. Allocated memory was 210.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 164.7MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-09-29 23:02:52,765 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.35ms. Allocated memory is still 210.8MB. Free memory was 170.9MB in the beginning and 170.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 23:02:52,765 INFO L158 Benchmark]: Boogie Preprocessor took 117.25ms. Allocated memory is still 210.8MB. Free memory was 164.7MB in the beginning and 158.4MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-09-29 23:02:52,765 INFO L158 Benchmark]: RCFGBuilder took 1067.64ms. Allocated memory was 210.8MB in the beginning and 273.7MB in the end (delta: 62.9MB). Free memory was 158.2MB in the beginning and 239.4MB in the end (delta: -81.2MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2022-09-29 23:02:52,765 INFO L158 Benchmark]: TraceAbstraction took 789435.77ms. Allocated memory was 273.7MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 238.9MB in the beginning and 3.7GB in the end (delta: -3.4GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-09-29 23:02:52,766 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.35ms. Allocated memory is still 210.8MB. Free memory was 170.9MB in the beginning and 170.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 117.25ms. Allocated memory is still 210.8MB. Free memory was 164.7MB in the beginning and 158.4MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1067.64ms. Allocated memory was 210.8MB in the beginning and 273.7MB in the end (delta: 62.9MB). Free memory was 158.2MB in the beginning and 239.4MB in the end (delta: -81.2MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. * TraceAbstraction took 789435.77ms. Allocated memory was 273.7MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 238.9MB in the beginning and 3.7GB in the end (delta: -3.4GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 527, positive: 511, positive conditional: 511, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 511, Positive conditional cache size: 0, Positive unconditional cache size: 511, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 16, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1712, positive: 1663, positive conditional: 1663, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 1665, Positive cache size: 1665, Positive conditional cache size: 0, Positive unconditional cache size: 1665, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 65, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4352, positive: 4228, positive conditional: 4228, positive unconditional: 0, negative: 124, negative conditional: 124, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 4121, Positive cache size: 4117, Positive conditional cache size: 0, Positive unconditional cache size: 4117, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 185, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 45895, positive: 44441, positive conditional: 44441, positive unconditional: 0, negative: 1454, negative conditional: 1454, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 39595, Positive cache size: 39492, Positive conditional cache size: 0, Positive unconditional cache size: 39492, Negative cache size: 103, Negative conditional cache size: 0, Negative unconditional cache size: 103, Independence queries for same thread: 1528, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24674, positive: 23837, positive conditional: 23837, positive unconditional: 0, negative: 837, negative conditional: 837, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 41884, Positive cache size: 41718, Positive conditional cache size: 0, Positive unconditional cache size: 41718, Negative cache size: 166, Negative conditional cache size: 0, Negative unconditional cache size: 166, Independence queries for same thread: 2205, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 25498, positive: 24621, positive conditional: 24621, positive unconditional: 0, negative: 877, negative conditional: 877, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 45929, Positive cache size: 45746, Positive conditional cache size: 0, Positive unconditional cache size: 45746, Negative cache size: 183, Negative conditional cache size: 0, Negative unconditional cache size: 183, Independence queries for same thread: 2921, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 26202, positive: 25317, positive conditional: 25317, positive unconditional: 0, negative: 885, negative conditional: 885, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 46465, Positive cache size: 46279, Positive conditional cache size: 0, Positive unconditional cache size: 46279, Negative cache size: 186, Negative conditional cache size: 0, Negative unconditional cache size: 186, Independence queries for same thread: 3641, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24881, positive: 24036, positive conditional: 24036, positive unconditional: 0, negative: 845, negative conditional: 845, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 46716, Positive cache size: 46530, Positive conditional cache size: 0, Positive unconditional cache size: 46530, Negative cache size: 186, Negative conditional cache size: 0, Negative unconditional cache size: 186, Independence queries for same thread: 4327, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 25109, positive: 24258, positive conditional: 24258, positive unconditional: 0, negative: 851, negative conditional: 851, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 46927, Positive cache size: 46741, Positive conditional cache size: 0, Positive unconditional cache size: 46741, Negative cache size: 186, Negative conditional cache size: 0, Negative unconditional cache size: 186, Independence queries for same thread: 5019, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5798, positive: 5613, positive conditional: 5613, positive unconditional: 0, negative: 185, negative conditional: 185, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 47454, Positive cache size: 47267, Positive conditional cache size: 0, Positive unconditional cache size: 47267, Negative cache size: 187, Negative conditional cache size: 0, Negative unconditional cache size: 187, Independence queries for same thread: 5201, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 44153, positive: 42621, positive conditional: 42621, positive unconditional: 0, negative: 1532, negative conditional: 1532, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 228801, positive: 221146, positive conditional: 221146, positive unconditional: 0, negative: 7655, negative conditional: 7655, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222383, positive: 221146, positive conditional: 0, positive unconditional: 221146, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48251, positive: 48064, positive conditional: 0, positive unconditional: 48064, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222383, positive: 173082, positive conditional: 0, positive unconditional: 173082, negative: 1050, negative conditional: 0, negative unconditional: 1050, unknown: 48251, unknown conditional: 0, unknown unconditional: 48251] , Statistics on independence cache: Total cache size (in pairs): 48251, Positive cache size: 48064, Positive conditional cache size: 0, Positive unconditional cache size: 48064, Negative cache size: 187, Negative conditional cache size: 0, Negative unconditional cache size: 187, Independence queries for same thread: 6418, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1583]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 4539 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - 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: 789.3s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 155.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 844, 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.8s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 34834 NumberOfCodeBlocks, 31786 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 34822 ConstructedInterpolants, 0 QuantifiedInterpolants, 167399 SizeOfPredicates, 139 NumberOfNonLiveVariables, 11512 ConjunctsInSsa, 284 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 98902/101984 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