/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1214.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:26:58,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:26:58,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:26:58,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:26:58,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:26:58,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:26:58,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:26:58,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:26:58,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:26:58,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:26:58,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:26:58,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:26:58,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:26:58,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:26:58,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:26:58,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:26:58,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:26:58,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:26:58,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:26:58,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:26:58,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:26:58,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:26:58,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:26:58,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:26:58,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:26:58,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:26:58,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:26:58,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:26:58,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:26:58,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:26:58,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:26:58,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:26:58,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:26:58,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:26:58,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:26:58,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:26:58,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:26:58,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:26:58,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:26:58,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:26:58,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:26:58,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:26:58,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:26:58,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:26:58,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:26:58,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:26:58,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:26:58,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:26:58,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:26:58,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:26:58,712 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:26:58,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:26:58,712 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:26:58,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:26:58,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:26:58,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:26:58,714 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:26:58,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:26:58,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:26:58,715 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:26:58,715 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:26:58,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:26:58,715 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:26:58,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:26:58,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:26:58,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:26:58,906 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:26:58,907 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:26:58,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1214.bpl [2022-10-03 14:26:58,908 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1214.bpl' [2022-10-03 14:26:58,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:26:58,983 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:26:58,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:26:58,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:26:58,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:26:59,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:26:59,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:26:59,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:26:59,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:26:59,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/1) ... [2022-10-03 14:26:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:26:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:26:59,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:26:59,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:26:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:26:59,177 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:26:59,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:26:59,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:26:59,179 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:26:59,305 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:26:59,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:27:00,243 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:27:00,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:27:00,259 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:27:00,262 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:27:00 BoogieIcfgContainer [2022-10-03 14:27:00,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:27:00,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:27:00,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:27:00,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:27:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:26:58" (1/2) ... [2022-10-03 14:27:00,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be2c3f and model type divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:27:00, skipping insertion in model container [2022-10-03 14:27:00,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1214.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:27:00" (2/2) ... [2022-10-03 14:27:00,271 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1214.bpl [2022-10-03 14:27:00,277 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:27:00,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:27:00,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:27:00,283 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:27:00,424 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:27:00,480 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:27:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:27:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:27:00,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:27:00,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:27:00,506 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:27:00,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:27:00,517 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;@231a546b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:27:00,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:27:00,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash 878422577, now seen corresponding path program 1 times [2022-10-03 14:27:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:00,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164887371] [2022-10-03 14:27:00,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:27:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164887371] [2022-10-03 14:27:01,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164887371] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:27:01,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:27:01,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:27:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77692560] [2022-10-03 14:27:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:27:01,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:27:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:27:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:27:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:27:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:01,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:27:01,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 216.5) internal successors, (433), 2 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:27:01,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:01,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:27:01,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 821527028, now seen corresponding path program 1 times [2022-10-03 14:27:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:01,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161424598] [2022-10-03 14:27:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:27:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161424598] [2022-10-03 14:27:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161424598] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:27:04,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:27:04,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-10-03 14:27:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522214043] [2022-10-03 14:27:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:27:04,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-10-03 14:27:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:27:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-10-03 14:27:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4213, Unknown=0, NotChecked=0, Total=4422 [2022-10-03 14:27:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:04,235 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:27:04,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 7.462686567164179) internal successors, (500), 67 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:27:04,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:04,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:27:18,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:27:18,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1270341128, now seen corresponding path program 1 times [2022-10-03 14:27:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:18,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373249641] [2022-10-03 14:27:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:27:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:19,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373249641] [2022-10-03 14:27:19,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373249641] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:27:19,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:27:19,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-10-03 14:27:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512694041] [2022-10-03 14:27:19,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:27:19,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-10-03 14:27:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:27:19,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-10-03 14:27:19,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3474, Unknown=0, NotChecked=0, Total=3660 [2022-10-03 14:27:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:19,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:27:19,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 7.383333333333334) internal successors, (443), 61 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:27:19,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:19,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:27:19,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:27:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:27:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:27:38,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:27:38,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:27:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:27:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -515136731, now seen corresponding path program 1 times [2022-10-03 14:27:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:27:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970057912] [2022-10-03 14:27:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:27:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 23580 backedges. 4388 proven. 12736 refuted. 0 times theorem prover too weak. 6456 trivial. 0 not checked. [2022-10-03 14:27:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:27:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970057912] [2022-10-03 14:27:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970057912] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:27:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772860267] [2022-10-03 14:27:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:27:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:27:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:27:47,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:27:47,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:27:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:27:49,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 12451 conjuncts, 91 conjunts are in the unsatisfiable core [2022-10-03 14:27:49,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:27:56,716 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-10-03 14:27:57,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-10-03 14:27:57,775 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 14:27:57,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 14:27:58,666 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-10-03 14:27:58,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-10-03 14:27:58,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:27:58,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-10-03 14:27:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23580 backedges. 12742 proven. 4759 refuted. 0 times theorem prover too weak. 6079 trivial. 0 not checked. [2022-10-03 14:27:58,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:27:59,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) is different from false [2022-10-03 14:27:59,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:27:59,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:27:59,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-10-03 14:27:59,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:27:59,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:28:01,786 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 54 treesize of output 46 [2022-10-03 14:28:01,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-10-03 14:28:01,795 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 20 treesize of output 16 [2022-10-03 14:28:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23580 backedges. 12443 proven. 3832 refuted. 274 times theorem prover too weak. 6079 trivial. 952 not checked. [2022-10-03 14:28:07,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772860267] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:28:07,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:28:07,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 33, 32] total 122 [2022-10-03 14:28:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033681349] [2022-10-03 14:28:07,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:28:07,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-10-03 14:28:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:28:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-10-03 14:28:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=13171, Unknown=30, NotChecked=1170, Total=14762 [2022-10-03 14:28:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:07,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:28:07,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 52.295081967213115) internal successors, (6380), 122 states have internal predecessors, (6380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:28:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:28:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:28:07,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:26,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (or (forall ((v_ArrVal_921 (Array Int Int))) (not (= |c_#memory_$Pointer$.base| (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_921)))) (not (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|))) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (+ .cse1 12) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1))) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|))) is different from false [2022-10-03 14:28:27,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (or (forall ((v_ArrVal_921 (Array Int Int))) (not (= |c_#memory_$Pointer$.base| (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_921)))) (not (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|))) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= .cse0 |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (+ .cse2 12) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2))) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-10-03 14:28:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:28:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:28:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-10-03 14:28:32,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:28:32,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-10-03 14:28:32,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:28:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:28:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 553290758, now seen corresponding path program 1 times [2022-10-03 14:28:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:28:32,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036828138] [2022-10-03 14:28:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:28:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:28:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:28:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 690 proven. 0 refuted. 0 times theorem prover too weak. 2334 trivial. 0 not checked. [2022-10-03 14:28:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:28:35,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036828138] [2022-10-03 14:28:35,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036828138] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:28:35,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:28:35,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 14:28:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548072236] [2022-10-03 14:28:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:28:35,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 14:28:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:28:35,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 14:28:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5315, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 14:28:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:35,756 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:28:35,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 16.32) internal successors, (1224), 75 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:28:35,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:28:35,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:28:35,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:28:35,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-10-03 14:28:35,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:29:34,675 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (let ((.cse0 (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (+ .cse0 12) (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or (forall ((v_ArrVal_921 (Array Int Int))) (not (= |c_#memory_$Pointer$.base| (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_921)))) (not (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|)) is different from false [2022-10-03 14:29:34,868 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or (forall ((v_ArrVal_921 (Array Int Int))) (not (= |c_#memory_$Pointer$.base| (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_921)))) (not (<= 0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_924) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:29:44,822 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (select .cse5 0)) (.cse2 (select .cse3 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| .cse0) 0) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= .cse1 .cse2)) (= .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base| .cse2) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select |c_#valid| .cse0) 0) (= (select |c_#valid| .cse1) 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (+ .cse4 12) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse4))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| .cse2) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)))) is different from false [2022-10-03 14:29:44,832 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:29:44,882 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:29:44,886 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:29:44,890 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:29:44,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select .cse0 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false [2022-10-03 14:29:44,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select .cse0 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false [2022-10-03 14:29:44,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_924 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_924) |c_#memory_$Pointer$.base|))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= (select (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 0) (select .cse0 0))) (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) is different from false [2022-10-03 14:30:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:30:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:30:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2022-10-03 14:30:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:30:22,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:30:22,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:30:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:30:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1249590679, now seen corresponding path program 1 times [2022-10-03 14:30:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:30:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750452469] [2022-10-03 14:30:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:30:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 166065 backedges. 60087 proven. 0 refuted. 0 times theorem prover too weak. 105978 trivial. 0 not checked. [2022-10-03 14:30:45,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:30:45,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750452469] [2022-10-03 14:30:45,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750452469] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:30:45,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:30:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-10-03 14:30:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896507985] [2022-10-03 14:30:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:30:45,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-03 14:30:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:30:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-03 14:30:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2022-10-03 14:30:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:45,545 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:30:45,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 80.18181818181819) internal successors, (1764), 22 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:30:45,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:45,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:30:45,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:30:45,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 465 states. [2022-10-03 14:30:45,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:30:45,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:30:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:30:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:30:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:30:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:30:50,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 14:30:50,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:30:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:30:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1326042483, now seen corresponding path program 2 times [2022-10-03 14:30:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:30:50,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808455659] [2022-10-03 14:30:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:30:50,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:30:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:30:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7513 backedges. 1361 proven. 0 refuted. 0 times theorem prover too weak. 6152 trivial. 0 not checked. [2022-10-03 14:30:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:30:56,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808455659] [2022-10-03 14:30:56,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808455659] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:30:56,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:30:56,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-10-03 14:30:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770410977] [2022-10-03 14:30:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:30:56,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-10-03 14:30:56,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:30:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-10-03 14:30:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=6227, Unknown=0, NotChecked=0, Total=6480 [2022-10-03 14:30:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:56,518 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:30:56,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 16.950617283950617) internal successors, (1373), 81 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:30:56,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:31:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:31:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:31:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:31:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:31:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-10-03 14:31:25,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 14:31:25,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:31:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:31:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1929024591, now seen corresponding path program 1 times [2022-10-03 14:31:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:31:25,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977376971] [2022-10-03 14:31:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:31:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 24 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:31:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977376971] [2022-10-03 14:31:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977376971] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:31:28,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734175273] [2022-10-03 14:31:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:28,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:31:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:31:28,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:31:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:31:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:29,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 2178 conjuncts, 114 conjunts are in the unsatisfiable core [2022-10-03 14:31:29,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:31:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 97 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:33,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:31:35,369 INFO L356 Elim1Store]: treesize reduction 4, result has 93.5 percent of original size [2022-10-03 14:31:35,369 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 42 treesize of output 79 [2022-10-03 14:31:35,420 INFO L356 Elim1Store]: treesize reduction 13, result has 79.0 percent of original size [2022-10-03 14:31:35,420 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 32 treesize of output 60 [2022-10-03 14:31:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:36,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734175273] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 14:31:36,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 14:31:36,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [89, 32] total 140 [2022-10-03 14:31:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876596676] [2022-10-03 14:31:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:31:36,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-03 14:31:36,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:31:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-03 14:31:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=18963, Unknown=0, NotChecked=0, Total=19460 [2022-10-03 14:31:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:36,158 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:31:36,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 39.17391304347826) internal successors, (901), 23 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2022-10-03 14:31:36,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-10-03 14:31:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-03 14:31:40,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 14:31:40,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:31:40,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:31:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:31:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1094130046, now seen corresponding path program 1 times [2022-10-03 14:31:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:31:40,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118272361] [2022-10-03 14:31:40,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:31:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 24 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:31:43,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118272361] [2022-10-03 14:31:43,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118272361] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:31:43,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064399562] [2022-10-03 14:31:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:43,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:31:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:31:43,517 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-10-03 14:31:43,518 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-10-03 14:31:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:43,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 256 conjunts are in the unsatisfiable core [2022-10-03 14:31:43,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:31:44,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:31:44,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 14:31:45,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:31:45,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:31:45,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-03 14:31:49,438 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 14:31:49,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 14:31:50,055 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 14:31:50,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2022-10-03 14:31:50,077 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:31:50,077 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 2 case distinctions, treesize of input 73 treesize of output 69 [2022-10-03 14:31:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-10-03 14:31:56,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:31:56,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064399562] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:31:56,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:31:56,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [89] total 162 [2022-10-03 14:31:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436201794] [2022-10-03 14:31:56,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:31:56,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 14:31:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:31:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 14:31:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=25469, Unknown=0, NotChecked=0, Total=26082 [2022-10-03 14:31:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:56,848 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:31:56,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 10.493333333333334) internal successors, (787), 75 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:31:56,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-10-03 14:31:56,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-03 14:32:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:32:29,771 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-10-03 14:32:29,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:32:29,958 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:32:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:32:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1409980636, now seen corresponding path program 1 times [2022-10-03 14:32:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:32:29,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644362052] [2022-10-03 14:32:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:32:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:32:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:32:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:32:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:32:32,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644362052] [2022-10-03 14:32:32,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644362052] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:32:32,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:32:32,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-10-03 14:32:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240959491] [2022-10-03 14:32:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:32:32,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-10-03 14:32:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:32:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-10-03 14:32:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3866, Unknown=0, NotChecked=0, Total=4032 [2022-10-03 14:32:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:32,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:32:32,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 8.78125) internal successors, (562), 64 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:32:32,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 466 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-03 14:33:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:33:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-10-03 14:33:08,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-03 14:33:08,158 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 754531235, now seen corresponding path program 1 times [2022-10-03 14:33:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554201119] [2022-10-03 14:33:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 50 proven. 398 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-03 14:33:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:33:23,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554201119] [2022-10-03 14:33:23,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554201119] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:33:23,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071864723] [2022-10-03 14:33:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:33:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:33:23,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:33:23,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 14:33:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:23,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 2282 conjuncts, 353 conjunts are in the unsatisfiable core [2022-10-03 14:33:23,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:33:24,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:33:25,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:33:26,871 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-10-03 14:33:26,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-10-03 14:33:27,669 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 24 treesize of output 24 [2022-10-03 14:33:39,792 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-10-03 14:33:39,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2022-10-03 14:33:41,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:41,460 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 22 treesize of output 21 [2022-10-03 14:33:41,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 14:33:42,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:42,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 14:33:42,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:42,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:42,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-10-03 14:33:43,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:43,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:43,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:43,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-10-03 14:33:43,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-10-03 14:33:45,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:45,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:45,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:45,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:45,937 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-03 14:33:45,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 71 [2022-10-03 14:33:45,959 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-03 14:33:45,960 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 43 [2022-10-03 14:33:46,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:47,006 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-03 14:33:47,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-10-03 14:33:47,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:47,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:47,033 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-03 14:33:47,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 49 [2022-10-03 14:33:47,998 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:33:47,999 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-10-03 14:33:48,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:48,022 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-10-03 14:33:48,023 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-10-03 14:33:48,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 14:33:48,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 14:33:48,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 14:33:48,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:48,884 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 40 treesize of output 39 [2022-10-03 14:33:48,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:48,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-10-03 14:33:58,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:33:58,938 INFO L356 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2022-10-03 14:33:58,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 50 [2022-10-03 14:33:58,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:58,946 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 14:33:58,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 23 [2022-10-03 14:33:59,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:33:59,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:34:00,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:34:00,102 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 14:34:00,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:34:00,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:34:00,107 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 15 treesize of output 10 [2022-10-03 14:34:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 32 proven. 358 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-10-03 14:34:00,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:34:00,764 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 28 treesize of output 24 [2022-10-03 14:34:00,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:34:00,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:36:07,870 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)