java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:30:21,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:30:21,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:30:21,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:30:21,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:30:21,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:30:21,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:30:21,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:30:21,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:30:21,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:30:21,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:30:21,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:30:21,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:30:21,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:30:21,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:30:21,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:30:21,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:30:21,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:30:21,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:30:21,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:30:21,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:30:21,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:30:21,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:30:21,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:30:21,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:30:21,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:30:21,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:30:21,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:30:21,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:30:21,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:30:21,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:30:21,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:30:21,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:30:21,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:30:21,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:30:21,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:30:21,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:30:21,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:30:21,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:30:21,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:30:21,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:30:21,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:30:21,573 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:30:21,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:30:21,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:30:21,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:30:21,575 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:30:21,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:30:21,575 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:30:21,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:30:21,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:30:21,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:30:21,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:30:21,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:30:21,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:30:21,576 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:30:21,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:30:21,577 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:30:21,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:30:21,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:30:21,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:30:21,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:30:21,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:30:21,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:30:21,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:30:21,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:30:21,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:30:21,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:30:21,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:30:21,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:30:21,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:30:21,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:30:21,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:30:21,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:30:21,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:30:21,654 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:30:21,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2.i [2019-09-05 11:30:21,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0087751b/e553276b00a942618ccd5e7907d69489/FLAG16a56a368 [2019-09-05 11:30:22,158 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:30:22,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2019-09-05 11:30:22,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0087751b/e553276b00a942618ccd5e7907d69489/FLAG16a56a368 [2019-09-05 11:30:22,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0087751b/e553276b00a942618ccd5e7907d69489 [2019-09-05 11:30:22,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:30:22,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:30:22,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:30:22,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:30:22,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:30:22,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b533bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22, skipping insertion in model container [2019-09-05 11:30:22,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:30:22,612 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:30:22,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:30:22,807 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:30:22,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:30:22,940 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:30:22,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22 WrapperNode [2019-09-05 11:30:22,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:30:22,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:30:22,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:30:22,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:30:22,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... [2019-09-05 11:30:22,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:30:22,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:30:22,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:30:22,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:30:22,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:30:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:30:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:30:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:30:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:30:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:30:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:30:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:30:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:30:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:30:23,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:30:23,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:30:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:30:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:30:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:30:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:30:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:30:23,433 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:30:23,434 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-05 11:30:23,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:30:23 BoogieIcfgContainer [2019-09-05 11:30:23,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:30:23,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:30:23,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:30:23,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:30:23,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:30:22" (1/3) ... [2019-09-05 11:30:23,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6390a804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:30:23, skipping insertion in model container [2019-09-05 11:30:23,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:30:22" (2/3) ... [2019-09-05 11:30:23,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6390a804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:30:23, skipping insertion in model container [2019-09-05 11:30:23,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:30:23" (3/3) ... [2019-09-05 11:30:23,443 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2019-09-05 11:30:23,454 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:30:23,462 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:30:23,479 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:30:23,510 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:30:23,510 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:30:23,511 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:30:23,511 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:30:23,511 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:30:23,511 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:30:23,511 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:30:23,511 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:30:23,512 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:30:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-05 11:30:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:30:23,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:23,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:23,537 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:23,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1823924036, now seen corresponding path program 1 times [2019-09-05 11:30:23,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:23,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:23,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:23,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:30:23,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:30:23,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:30:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:30:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:30:23,705 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-05 11:30:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:23,732 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-09-05 11:30:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:30:23,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-05 11:30:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:23,743 INFO L225 Difference]: With dead ends: 55 [2019-09-05 11:30:23,743 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:30:23,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:30:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:30:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 11:30:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:30:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-05 11:30:23,795 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-09-05 11:30:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:23,796 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-05 11:30:23,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:30:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-05 11:30:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:30:23,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:23,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:23,798 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1169658974, now seen corresponding path program 1 times [2019-09-05 11:30:23,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:23,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:23,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:23,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:30:23,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:30:23,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:30:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:30:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:30:23,972 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-09-05 11:30:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:24,138 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-05 11:30:24,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:30:24,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-05 11:30:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:24,144 INFO L225 Difference]: With dead ends: 62 [2019-09-05 11:30:24,145 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:30:24,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:30:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:30:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-09-05 11:30:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:30:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-05 11:30:24,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2019-09-05 11:30:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:24,165 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-05 11:30:24,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:30:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-05 11:30:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:30:24,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:24,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:24,167 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1835570138, now seen corresponding path program 1 times [2019-09-05 11:30:24,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:24,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:24,893 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2019-09-05 11:30:25,145 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2019-09-05 11:30:25,385 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 37 [2019-09-05 11:30:25,660 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 35 [2019-09-05 11:30:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:25,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:25,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:25,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:25,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:30:25,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:25,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:25,877 INFO L375 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 23 treesize of output 27 [2019-09-05 11:30:25,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:25,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:25,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:25,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-09-05 11:30:25,966 INFO L375 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 0 case distinctions, treesize of input 21 treesize of output 24 [2019-09-05 11:30:25,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:25,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:25,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:25,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-09-05 11:30:26,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-09-05 11:30:26,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:26,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:26,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2019-09-05 11:30:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:30:26,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-09-05 11:30:26,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:30:26,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:30:26,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:30:26,161 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 19 states. [2019-09-05 11:30:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:26,877 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-09-05 11:30:26,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:30:26,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-05 11:30:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:26,879 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:30:26,879 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 11:30:26,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:30:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 11:30:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-05 11:30:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:30:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-09-05 11:30:26,889 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2019-09-05 11:30:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:26,889 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-09-05 11:30:26,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:30:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-09-05 11:30:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:30:26,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:26,891 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:26,891 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 997765806, now seen corresponding path program 1 times [2019-09-05 11:30:26,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:26,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:26,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 11:30:27,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:27,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:27,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:30:27,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:30:27,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:27,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-05 11:30:27,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:30:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:30:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:30:27,248 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 11 states. [2019-09-05 11:30:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:27,432 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-09-05 11:30:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:30:27,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-05 11:30:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:27,436 INFO L225 Difference]: With dead ends: 76 [2019-09-05 11:30:27,436 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 11:30:27,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:30:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 11:30:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-09-05 11:30:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:30:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-09-05 11:30:27,446 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 36 [2019-09-05 11:30:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:27,446 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-09-05 11:30:27,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:30:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-09-05 11:30:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:30:27,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:27,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:27,448 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:27,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1913486187, now seen corresponding path program 2 times [2019-09-05 11:30:27,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:27,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:27,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:28,027 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 44 [2019-09-05 11:30:28,284 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2019-09-05 11:30:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 11:30:28,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:28,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:28,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:28,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:30:28,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:28,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:30:28,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:28,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:28,425 INFO L375 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 23 treesize of output 27 [2019-09-05 11:30:28,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:28,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:28,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:28,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-05 11:30:28,528 INFO L375 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 0 case distinctions, treesize of input 27 treesize of output 30 [2019-09-05 11:30:28,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:28,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:28,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:28,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-05 11:30:30,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2019-09-05 11:30:30,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:30,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:30,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:30,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:5 [2019-09-05 11:30:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:30:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-09-05 11:30:30,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:30:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:30:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=441, Unknown=1, NotChecked=0, Total=506 [2019-09-05 11:30:30,987 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 23 states. [2019-09-05 11:30:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:32,303 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-09-05 11:30:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:30:32,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-09-05 11:30:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:32,304 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:30:32,305 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 11:30:32,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=197, Invalid=1062, Unknown=1, NotChecked=0, Total=1260 [2019-09-05 11:30:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 11:30:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-09-05 11:30:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 11:30:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-09-05 11:30:32,316 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-09-05 11:30:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:32,317 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-09-05 11:30:32,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:30:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-09-05 11:30:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:30:32,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:32,319 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:32,319 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1115964468, now seen corresponding path program 3 times [2019-09-05 11:30:32,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:32,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-05 11:30:32,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:32,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:32,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:30:32,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:30:32,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:32,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:30:32,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-05 11:30:32,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:32,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-09-05 11:30:32,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:30:32,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:30:32,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:30:32,645 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 12 states. [2019-09-05 11:30:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:32,942 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2019-09-05 11:30:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:30:32,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-05 11:30:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:32,944 INFO L225 Difference]: With dead ends: 129 [2019-09-05 11:30:32,944 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 11:30:32,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:30:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 11:30:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-09-05 11:30:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:30:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-09-05 11:30:32,957 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 49 [2019-09-05 11:30:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:32,958 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-09-05 11:30:32,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:30:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-09-05 11:30:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-05 11:30:32,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:32,959 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:32,960 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:32,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1071400400, now seen corresponding path program 4 times [2019-09-05 11:30:32,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:32,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:32,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:32,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:32,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:33,975 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 43 [2019-09-05 11:30:34,211 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 49 [2019-09-05 11:30:34,651 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 40 [2019-09-05 11:30:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:30:34,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:34,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:34,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:30:34,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:30:34,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:34,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:30:34,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:34,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:34,810 INFO L375 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 23 treesize of output 27 [2019-09-05 11:30:34,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:34,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:34,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:34,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-05 11:30:34,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:30:34,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:34,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:34,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:34,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-05 11:30:34,950 INFO L375 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 0 case distinctions, treesize of input 60 treesize of output 62 [2019-09-05 11:30:34,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:34,986 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-09-05 11:30:34,986 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_13| vanished before elimination [2019-09-05 11:30:34,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:34,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-09-05 11:30:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:35,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:35,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:35,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:35,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 112 [2019-09-05 11:30:35,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:35,109 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:30:35,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:35,141 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-09-05 11:30:35,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:35,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-09-05 11:30:35,289 INFO L341 Elim1Store]: treesize reduction 124, result has 12.1 percent of original size [2019-09-05 11:30:35,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 88 [2019-09-05 11:30:35,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:35,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:35,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:35,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-09-05 11:30:37,501 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.base_BEFORE_CALL_2| Int) (|v_main_~#C~0.offset_BEFORE_CALL_2| Int) (|v_main_~#B~0.offset_BEFORE_CALL_2| Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_2|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|))) (and (not (= |v_main_~#C~0.base_BEFORE_CALL_2| |v_main_~#B~0.base_BEFORE_CALL_2|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_2| 8)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_2| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 8)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_2| 4)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_2| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 4)))) (= (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_2|) (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_2|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_2|))) (not (= |v_main_~#A~0.base_BEFORE_CALL_2| |v_main_~#C~0.base_BEFORE_CALL_2|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_2| |v_main_~#B~0.base_BEFORE_CALL_2|))))) is different from true [2019-09-05 11:30:39,649 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-05 11:30:41,991 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.base_BEFORE_CALL_3| Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#C~0.offset_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_3|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|)) (.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|))) (and (not (= |v_main_~#C~0.base_BEFORE_CALL_3| |v_main_~#B~0.base_BEFORE_CALL_3|)) (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_3|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_3|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_3|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_3| |v_main_~#B~0.base_BEFORE_CALL_3|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_3| |v_main_~#C~0.base_BEFORE_CALL_3|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_3| 8)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_3| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 8)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_3| 4)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 4)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_3| 4))))))) is different from true [2019-09-05 11:30:42,214 INFO L341 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2019-09-05 11:30:42,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 25 [2019-09-05 11:30:42,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:42,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:42,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:42,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:103, output treesize:5 [2019-09-05 11:30:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2019-09-05 11:30:42,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:42,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2019-09-05 11:30:42,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:30:42,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:30:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1017, Unknown=2, NotChecked=130, Total=1260 [2019-09-05 11:30:42,338 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 36 states. [2019-09-05 11:30:44,745 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-05 11:30:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:47,511 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-09-05 11:30:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:30:47,515 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2019-09-05 11:30:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:47,517 INFO L225 Difference]: With dead ends: 92 [2019-09-05 11:30:47,517 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 11:30:47,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=420, Invalid=2778, Unknown=2, NotChecked=222, Total=3422 [2019-09-05 11:30:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 11:30:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2019-09-05 11:30:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 11:30:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-05 11:30:47,531 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 57 [2019-09-05 11:30:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:47,531 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-05 11:30:47,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:30:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-05 11:30:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-05 11:30:47,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:47,533 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:47,533 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:47,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:47,533 INFO L82 PathProgramCache]: Analyzing trace with hash 970592775, now seen corresponding path program 5 times [2019-09-05 11:30:47,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:47,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:47,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:47,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:47,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-05 11:30:47,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:47,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:06,223 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:31:06,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:06,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:31:06,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-05 11:31:06,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:06,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-05 11:31:06,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:31:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:31:06,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:31:06,344 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 15 states. [2019-09-05 11:31:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:06,789 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2019-09-05 11:31:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:31:06,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-09-05 11:31:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:06,794 INFO L225 Difference]: With dead ends: 164 [2019-09-05 11:31:06,794 INFO L226 Difference]: Without dead ends: 87 [2019-09-05 11:31:06,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:31:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-05 11:31:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-09-05 11:31:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 11:31:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-05 11:31:06,824 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 65 [2019-09-05 11:31:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:06,825 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-05 11:31:06,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:31:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-05 11:31:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-05 11:31:06,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:06,831 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:06,832 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash -639892289, now seen corresponding path program 6 times [2019-09-05 11:31:06,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:06,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:06,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:07,677 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-09-05 11:31:08,118 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 50 [2019-09-05 11:31:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-05 11:31:08,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:08,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:08,203 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:31:08,663 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-05 11:31:08,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:08,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 11:31:08,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:08,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:08,681 INFO L375 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 23 treesize of output 27 [2019-09-05 11:31:08,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:08,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-05 11:31:08,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:31:08,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:08,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-05 11:31:08,843 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:08,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,867 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-05 11:31:08,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:31:08,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:08,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:31:08,890 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:08,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,913 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-05 11:31:08,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:31:08,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:08,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:31:08,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-05 11:31:08,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,964 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-05 11:31:08,964 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-05 11:31:08,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:31:08,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:31:08,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:08,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:08,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-05 11:31:08,994 INFO L375 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 0 case distinctions, treesize of input 60 treesize of output 62 [2019-09-05 11:31:08,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,037 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-09-05 11:31:09,038 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_21| vanished before elimination [2019-09-05 11:31:09,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-09-05 11:31:09,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:09,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 112 [2019-09-05 11:31:09,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,180 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:09,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,216 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-09-05 11:31:09,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-09-05 11:31:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:09,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:09,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 162 [2019-09-05 11:31:09,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,422 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:09,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,470 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.4 percent of original size [2019-09-05 11:31:09,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:289, output treesize:133 [2019-09-05 11:31:09,673 INFO L341 Elim1Store]: treesize reduction 242, result has 9.7 percent of original size [2019-09-05 11:31:09,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 91 treesize of output 120 [2019-09-05 11:31:09,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:09,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:99 [2019-09-05 11:31:11,888 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#C~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#B~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (|v_main_~#C~0.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|)) (.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_4|))) (and (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_4| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_4| 12))) (not (= |v_main_~#C~0.base_BEFORE_CALL_4| |v_main_~#B~0.base_BEFORE_CALL_4|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_4| 4)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_4| 4)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 4)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_4| |v_main_~#C~0.base_BEFORE_CALL_4|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 8)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_4| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_4| 8))) (= (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_4|) (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_4|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_4|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_4| |v_main_~#B~0.base_BEFORE_CALL_4|))))) is different from true [2019-09-05 11:31:14,229 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.offset_BEFORE_CALL_5| Int) (|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (|v_main_~#B~0.offset_BEFORE_CALL_5| Int) (|v_main_~#C~0.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|)) (.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_5|))) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_5| |v_main_~#C~0.base_BEFORE_CALL_5|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_5| |v_main_~#B~0.base_BEFORE_CALL_5|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_5| 4))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_5| 4))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_5| 8)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_5| 8))) (not (= |v_main_~#C~0.base_BEFORE_CALL_5| |v_main_~#B~0.base_BEFORE_CALL_5|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_5| 12)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_5| 12)))) (= (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_5|) (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_5|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_5|))))) is different from true [2019-09-05 11:31:16,699 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.offset_BEFORE_CALL_6| Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (|v_main_~#B~0.offset_BEFORE_CALL_6| Int) (|v_main_~#C~0.base_BEFORE_CALL_6| Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_6|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|))) (and (= (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_6|) (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_6|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_6|))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_6| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_6| 4))) (not (= |v_main_~#A~0.base_BEFORE_CALL_6| |v_main_~#C~0.base_BEFORE_CALL_6|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_6| 12)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_6| 12)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 12)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_6| 8)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 8)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_6| 8)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_6| |v_main_~#B~0.base_BEFORE_CALL_6|)) (not (= |v_main_~#C~0.base_BEFORE_CALL_6| |v_main_~#B~0.base_BEFORE_CALL_6|))))) is different from true [2019-09-05 11:31:18,910 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-05 11:31:19,247 INFO L341 Elim1Store]: treesize reduction 198, result has 0.5 percent of original size [2019-09-05 11:31:19,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 3 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 18 case distinctions, treesize of input 114 treesize of output 30 [2019-09-05 11:31:19,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:19,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:19,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:19,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:5 [2019-09-05 11:31:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2019-09-05 11:31:19,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:19,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 39 [2019-09-05 11:31:19,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:31:19,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:31:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1138, Unknown=3, NotChecked=210, Total=1482 [2019-09-05 11:31:19,404 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 39 states. [2019-09-05 11:31:20,720 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-05 11:31:20,923 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-05 11:31:22,149 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-09-05 11:31:22,316 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2019-09-05 11:31:24,854 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2019-09-05 11:31:25,024 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-09-05 11:31:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:27,724 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2019-09-05 11:31:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:31:27,724 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2019-09-05 11:31:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:27,725 INFO L225 Difference]: With dead ends: 93 [2019-09-05 11:31:27,725 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 11:31:27,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=328, Invalid=2437, Unknown=3, NotChecked=312, Total=3080 [2019-09-05 11:31:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 11:31:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2019-09-05 11:31:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-05 11:31:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-09-05 11:31:27,738 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 73 [2019-09-05 11:31:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:27,739 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-09-05 11:31:27,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:31:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-09-05 11:31:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-05 11:31:27,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:27,740 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:27,740 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1692438026, now seen corresponding path program 7 times [2019-09-05 11:31:27,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:27,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:27,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-05 11:31:27,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:27,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:31:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:28,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:31:28,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-05 11:31:28,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-09-05 11:31:28,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:31:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:31:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:31:28,196 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 18 states. [2019-09-05 11:31:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:28,784 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2019-09-05 11:31:28,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:31:28,784 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-09-05 11:31:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:28,786 INFO L225 Difference]: With dead ends: 199 [2019-09-05 11:31:28,786 INFO L226 Difference]: Without dead ends: 103 [2019-09-05 11:31:28,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:31:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-05 11:31:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-09-05 11:31:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-05 11:31:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-09-05 11:31:28,799 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 81 [2019-09-05 11:31:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:28,800 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-09-05 11:31:28,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:31:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-09-05 11:31:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-05 11:31:28,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:28,802 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:28,802 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash -345217670, now seen corresponding path program 8 times [2019-09-05 11:31:28,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:28,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:28,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:29,972 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 45 [2019-09-05 11:31:30,509 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 39 [2019-09-05 11:31:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 8 proven. 127 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 11:31:30,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:30,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:31:30,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:31:30,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:30,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 11:31:30,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:30,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:30,668 INFO L375 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 23 treesize of output 27 [2019-09-05 11:31:30,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:30,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-05 11:31:30,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:31:30,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:30,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:31:30,918 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:30,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,945 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:31:30,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:31:30,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:30,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:31:30,968 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:30,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:30,997 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:31:31,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:31:31,005 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:31,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:31:31,031 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:31,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,064 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:31:31,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:31:31,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:31,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:31:31,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-05 11:31:31,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,134 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-05 11:31:31,135 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-09-05 11:31:31,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:31:31,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:31:31,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:31,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:31:31,171 INFO L375 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 0 case distinctions, treesize of input 66 treesize of output 68 [2019-09-05 11:31:31,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,224 INFO L567 ElimStorePlain]: treesize reduction 76, result has 42.9 percent of original size [2019-09-05 11:31:31,225 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_31| vanished before elimination [2019-09-05 11:31:31,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-09-05 11:31:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:31,347 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:31,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,370 INFO L341 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2019-09-05 11:31:31,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 118 [2019-09-05 11:31:31,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,417 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-09-05 11:31:31,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:98 [2019-09-05 11:31:31,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:31,586 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:31,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:31,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:31,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,706 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 44 DAG size of output: 24 [2019-09-05 11:31:33,706 INFO L341 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2019-09-05 11:31:33,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 168 [2019-09-05 11:31:33,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:33,800 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.5 percent of original size [2019-09-05 11:31:33,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:33,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:301, output treesize:139 [2019-09-05 11:31:33,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:33,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:33,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,121 INFO L235 Elim1Store]: Index analysis took 129 ms [2019-09-05 11:31:34,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 218 [2019-09-05 11:31:34,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:34,134 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:34,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:34,216 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.3 percent of original size [2019-09-05 11:31:34,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:34,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:383, output treesize:180 [2019-09-05 11:31:34,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:31:34,522 INFO L341 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-09-05 11:31:34,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 23 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 152 [2019-09-05 11:31:34,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:34,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:34,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:34,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:132, output treesize:128 [2019-09-05 11:31:38,128 INFO L341 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2019-09-05 11:31:38,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 13 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 35 [2019-09-05 11:31:38,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:38,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:38,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:31:38,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:129, output treesize:5 [2019-09-05 11:31:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 11:31:38,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:38,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 44 [2019-09-05 11:31:38,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:31:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:31:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1736, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:31:38,312 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 44 states. [2019-09-05 11:31:51,757 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-09-05 11:31:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:53,109 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-09-05 11:31:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:31:53,109 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 89 [2019-09-05 11:31:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:53,111 INFO L225 Difference]: With dead ends: 109 [2019-09-05 11:31:53,111 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 11:31:53,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 60 SyntacticMatches, 22 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=520, Invalid=4736, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 11:31:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 11:31:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-09-05 11:31:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 11:31:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-09-05 11:31:53,124 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 89 [2019-09-05 11:31:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:53,124 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-09-05 11:31:53,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:31:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-09-05 11:31:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-05 11:31:53,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:53,126 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:53,126 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash 340584369, now seen corresponding path program 9 times [2019-09-05 11:31:53,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:53,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:53,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 11:31:53,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:53,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:53,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:32:08,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:32:08,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:08,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:32:08,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 11:32:08,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:08,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-09-05 11:32:08,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:32:08,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:32:08,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:32:08,585 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 21 states. [2019-09-05 11:32:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:09,434 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2019-09-05 11:32:09,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:32:09,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2019-09-05 11:32:09,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:09,435 INFO L225 Difference]: With dead ends: 234 [2019-09-05 11:32:09,436 INFO L226 Difference]: Without dead ends: 119 [2019-09-05 11:32:09,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:32:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-05 11:32:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-09-05 11:32:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-05 11:32:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-09-05 11:32:09,455 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 97 [2019-09-05 11:32:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:09,455 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2019-09-05 11:32:09,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:32:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2019-09-05 11:32:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-05 11:32:09,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:09,456 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:09,456 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash 684911337, now seen corresponding path program 10 times [2019-09-05 11:32:09,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:09,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:09,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:10,324 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-05 11:32:10,452 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-05 11:32:10,727 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2019-09-05 11:32:11,330 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 39 [2019-09-05 11:32:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 10 proven. 137 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-05 11:32:11,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:11,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:11,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:32:11,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:32:11,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:11,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 11:32:11,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:11,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:11,518 INFO L375 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 23 treesize of output 27 [2019-09-05 11:32:11,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:11,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:11,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:11,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-05 11:32:11,748 INFO L375 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 0 case distinctions, treesize of input 27 treesize of output 30 [2019-09-05 11:32:11,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:11,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:11,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:11,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-09-05 11:32:37,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2019-09-05 11:32:37,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:37,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:37,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:37,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:63, output treesize:5 [2019-09-05 11:32:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:32:37,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2019-09-05 11:32:37,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:32:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:32:37,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1507, Unknown=2, NotChecked=0, Total=1640 [2019-09-05 11:32:37,689 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 41 states. [2019-09-05 11:32:45,445 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-05 11:32:49,725 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-05 11:32:54,011 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-05 11:32:58,295 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-05 11:33:02,559 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-05 11:33:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:09,484 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2019-09-05 11:33:09,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 11:33:09,485 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 105 [2019-09-05 11:33:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:09,487 INFO L225 Difference]: With dead ends: 146 [2019-09-05 11:33:09,489 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 11:33:09,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 79 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=737, Invalid=6743, Unknown=2, NotChecked=0, Total=7482 [2019-09-05 11:33:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 11:33:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2019-09-05 11:33:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 11:33:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2019-09-05 11:33:09,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 105 [2019-09-05 11:33:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:09,503 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2019-09-05 11:33:09,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:33:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2019-09-05 11:33:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-05 11:33:09,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:09,505 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:09,505 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1661636128, now seen corresponding path program 11 times [2019-09-05 11:33:09,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:09,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:09,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-05 11:33:09,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:09,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:34:17,623 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:34:17,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:34:17,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:34:17,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:34:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 102 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-05 11:34:18,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:34:18,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-09-05 11:34:18,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:34:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:34:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:34:18,206 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 24 states. [2019-09-05 11:34:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:34:19,302 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2019-09-05 11:34:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:34:19,303 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2019-09-05 11:34:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:34:19,305 INFO L225 Difference]: With dead ends: 269 [2019-09-05 11:34:19,305 INFO L226 Difference]: Without dead ends: 135 [2019-09-05 11:34:19,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:34:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-05 11:34:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-09-05 11:34:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-05 11:34:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2019-09-05 11:34:19,320 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 113 [2019-09-05 11:34:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:34:19,320 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2019-09-05 11:34:19,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:34:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2019-09-05 11:34:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 11:34:19,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:34:19,322 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:34:19,322 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:34:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:34:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash 870763300, now seen corresponding path program 12 times [2019-09-05 11:34:19,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:34:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:34:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:19,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:34:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:34:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:34:20,491 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 45 [2019-09-05 11:34:21,271 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 41 [2019-09-05 11:34:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 12 proven. 191 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-05 11:34:21,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:34:21,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:34:21,419 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:11,033 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-05 11:35:11,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:11,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 11:35:11,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:11,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:11,480 INFO L375 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 23 treesize of output 27 [2019-09-05 11:35:11,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:11,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-05 11:35:11,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:35:11,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:11,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:35:11,835 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:11,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,875 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:11,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:11,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:11,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:11,898 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:11,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,929 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:11,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:11,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:11,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:11,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:11,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-05 11:35:11,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,011 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-05 11:35:12,011 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_40| vanished before elimination [2019-09-05 11:35:12,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:12,018 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:12,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,058 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:12,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:12,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:12,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:12,087 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:12,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,125 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:12,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:12,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:12,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:12,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-05 11:35:12,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,218 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-05 11:35:12,218 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_43| vanished before elimination [2019-09-05 11:35:12,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:12,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:35:12,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:12,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:35:12,251 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:12,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,287 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.4 percent of original size [2019-09-05 11:35:12,291 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 42 [2019-09-05 11:35:12,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:12,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,309 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-09-05 11:35:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:12,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 94 [2019-09-05 11:35:12,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,481 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:12,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,526 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.7 percent of original size [2019-09-05 11:35:12,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:171, output treesize:74 [2019-09-05 11:35:12,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:12,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:12,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 126 [2019-09-05 11:35:12,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,774 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:12,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,823 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-09-05 11:35:12,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:12,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:217, output treesize:97 [2019-09-05 11:35:13,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:13,071 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:13,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:13,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,195 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-05 11:35:13,195 INFO L341 Elim1Store]: treesize reduction 32, result has 80.0 percent of original size [2019-09-05 11:35:13,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 260 [2019-09-05 11:35:13,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:13,276 INFO L567 ElimStorePlain]: treesize reduction 167, result has 41.8 percent of original size [2019-09-05 11:35:13,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:13,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:263, output treesize:120 [2019-09-05 11:35:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:13,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:13,723 INFO L235 Elim1Store]: Index analysis took 200 ms [2019-09-05 11:35:13,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 33 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 190 [2019-09-05 11:35:13,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:13,735 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:13,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:13,836 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-05 11:35:13,837 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.6 percent of original size [2019-09-05 11:35:13,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:13,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:309, output treesize:143 [2019-09-05 11:35:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:14,238 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:14,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:14,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:14,612 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2019-09-05 11:35:14,612 INFO L341 Elim1Store]: treesize reduction 190, result has 49.7 percent of original size [2019-09-05 11:35:14,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 33 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 378 [2019-09-05 11:35:14,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:14,743 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-05 11:35:14,743 INFO L567 ElimStorePlain]: treesize reduction 175, result has 51.3 percent of original size [2019-09-05 11:35:14,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:14,744 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:391, output treesize:184 [2019-09-05 11:35:15,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:15,184 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2019-09-05 11:35:15,184 INFO L341 Elim1Store]: treesize reduction 332, result has 13.8 percent of original size [2019-09-05 11:35:15,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 45 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 21 case distinctions, treesize of input 160 treesize of output 216 [2019-09-05 11:35:15,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:15,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:15,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:15,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:178, output treesize:174 [2019-09-05 11:35:27,888 INFO L341 Elim1Store]: treesize reduction 240, result has 0.4 percent of original size [2019-09-05 11:35:27,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 24 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 21 case distinctions, treesize of input 155 treesize of output 45 [2019-09-05 11:35:27,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:27,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:27,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:27,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:167, output treesize:5 [2019-09-05 11:35:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 15 proven. 273 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-05 11:35:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 36] total 57 [2019-09-05 11:35:28,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 11:35:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 11:35:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2981, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:35:28,215 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 57 states. [2019-09-05 11:35:40,542 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-09-05 11:35:43,261 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-09-05 11:35:46,045 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 103 [2019-09-05 11:35:46,307 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-09-05 11:35:47,018 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-09-05 11:35:47,478 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-09-05 11:35:47,729 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2019-09-05 11:35:48,024 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-09-05 11:35:48,281 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-09-05 11:35:48,530 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 94 [2019-09-05 11:35:48,804 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 89 [2019-09-05 11:35:49,025 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-05 11:35:49,288 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2019-09-05 11:35:49,564 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 94 [2019-09-05 11:35:50,033 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 93 [2019-09-05 11:35:50,299 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-05 11:35:50,515 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-09-05 11:35:50,781 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 95 [2019-09-05 11:35:51,085 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2019-09-05 11:35:51,325 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-05 11:35:51,598 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-09-05 11:35:52,335 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2019-09-05 11:35:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:52,634 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2019-09-05 11:35:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 11:35:52,634 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 121 [2019-09-05 11:35:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:52,636 INFO L225 Difference]: With dead ends: 156 [2019-09-05 11:35:52,636 INFO L226 Difference]: Without dead ends: 154 [2019-09-05 11:35:52,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 79 SyntacticMatches, 19 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3756 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=1002, Invalid=11208, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 11:35:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-05 11:35:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2019-09-05 11:35:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 11:35:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-09-05 11:35:52,656 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 121 [2019-09-05 11:35:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:52,656 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-09-05 11:35:52,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 11:35:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-09-05 11:35:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-05 11:35:52,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:52,658 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:52,658 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1207696549, now seen corresponding path program 13 times [2019-09-05 11:35:52,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:52,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:52,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:35:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 21 proven. 161 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-09-05 11:35:53,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:53,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:35:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:53,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:35:53,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 21 proven. 161 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-09-05 11:35:53,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:53,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2019-09-05 11:35:53,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:35:53,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:35:53,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:35:53,487 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 27 states. [2019-09-05 11:35:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:54,841 INFO L93 Difference]: Finished difference Result 304 states and 322 transitions. [2019-09-05 11:35:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:35:54,842 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-09-05 11:35:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:54,844 INFO L225 Difference]: With dead ends: 304 [2019-09-05 11:35:54,844 INFO L226 Difference]: Without dead ends: 151 [2019-09-05 11:35:54,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:35:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-05 11:35:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-09-05 11:35:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-05 11:35:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2019-09-05 11:35:54,860 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 129 [2019-09-05 11:35:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:54,860 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2019-09-05 11:35:54,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:35:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2019-09-05 11:35:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-05 11:35:54,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:54,862 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:54,862 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1892796653, now seen corresponding path program 14 times [2019-09-05 11:35:54,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:54,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:35:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:56,380 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-09-05 11:35:57,350 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2019-09-05 11:35:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 14 proven. 346 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 11:35:57,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:57,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:57,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:35:57,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:35:57,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:57,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-05 11:35:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:57,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:57,646 INFO L375 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 23 treesize of output 27 [2019-09-05 11:35:57,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:57,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:57,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:57,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-05 11:35:57,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:35:57,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:57,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:57,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:57,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:35:57,988 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:57,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,019 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:58,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:58,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:58,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-05 11:35:58,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,095 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-05 11:35:58,096 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_54| vanished before elimination [2019-09-05 11:35:58,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,101 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:58,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,134 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:58,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:58,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:58,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,159 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:58,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,193 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:58,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:58,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:58,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,217 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:58,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,248 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:58,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:58,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:58,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-09-05 11:35:58,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,321 INFO L567 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-09-05 11:35:58,322 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_58| vanished before elimination [2019-09-05 11:35:58,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,336 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:58,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,367 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-09-05 11:35:58,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:35:58,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:58,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:22 [2019-09-05 11:35:58,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:35:58,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:35:58,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-05 11:35:58,417 INFO L375 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 0 case distinctions, treesize of input 66 treesize of output 68 [2019-09-05 11:35:58,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,467 INFO L567 ElimStorePlain]: treesize reduction 76, result has 42.9 percent of original size [2019-09-05 11:35:58,467 INFO L464 ElimStorePlain]: Eliminatee v_prenex_45 vanished before elimination [2019-09-05 11:35:58,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:137, output treesize:57 [2019-09-05 11:35:58,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:58,601 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:58,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,631 INFO L341 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2019-09-05 11:35:58,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 118 [2019-09-05 11:35:58,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,678 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.1 percent of original size [2019-09-05 11:35:58,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:219, output treesize:98 [2019-09-05 11:35:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:58,835 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:58,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:58,893 INFO L341 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2019-09-05 11:35:58,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 168 [2019-09-05 11:35:58,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,959 INFO L567 ElimStorePlain]: treesize reduction 5, result has 96.5 percent of original size [2019-09-05 11:35:58,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:58,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:301, output treesize:139 [2019-09-05 11:35:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:59,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:35:59,290 INFO L235 Elim1Store]: Index analysis took 122 ms [2019-09-05 11:35:59,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 218 [2019-09-05 11:35:59,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:59,298 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:35:59,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:35:59,412 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-05 11:35:59,413 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.3 percent of original size [2019-09-05 11:35:59,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:35:59,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:383, output treesize:180 [2019-09-05 11:36:00,140 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-05 11:36:00,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:00,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:00,343 INFO L235 Elim1Store]: Index analysis took 194 ms [2019-09-05 11:36:00,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 33 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 268 [2019-09-05 11:36:00,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:00,352 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:36:00,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:00,486 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-05 11:36:00,487 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.8 percent of original size [2019-09-05 11:36:00,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:36:00,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:465, output treesize:221 [2019-09-05 11:36:01,451 WARN L188 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-05 11:36:01,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:01,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:01,837 INFO L235 Elim1Store]: Index analysis took 270 ms [2019-09-05 11:36:01,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 48 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 222 [2019-09-05 11:36:01,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:01,845 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:36:01,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:01,923 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.1 percent of original size [2019-09-05 11:36:01,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:36:01,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:355, output treesize:166 [2019-09-05 11:36:02,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:02,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,540 INFO L235 Elim1Store]: Index analysis took 361 ms [2019-09-05 11:36:02,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 66 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 272 [2019-09-05 11:36:02,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:02,548 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:36:02,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:02,645 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.6 percent of original size [2019-09-05 11:36:02,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:36:02,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:437, output treesize:207 [2019-09-05 11:36:02,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:02,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:03,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:03,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:03,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:03,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:36:03,134 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-09-05 11:36:03,135 INFO L341 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-09-05 11:36:03,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 59 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 28 case distinctions, treesize of input 183 treesize of output 248 [2019-09-05 11:36:03,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:03,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:03,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:36:03,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:201, output treesize:197 [2019-09-05 11:36:24,009 INFO L341 Elim1Store]: treesize reduction 322, result has 0.3 percent of original size [2019-09-05 11:36:24,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 31 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 50 [2019-09-05 11:36:24,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:36:24,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:36:24,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:36:24,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:186, output treesize:5 [2019-09-05 11:36:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-05 11:36:24,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:24,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40] total 62 [2019-09-05 11:36:24,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 11:36:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 11:36:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3492, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 11:36:24,424 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 62 states. [2019-09-05 11:36:33,791 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-05 11:36:36,406 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-09-05 11:36:36,840 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-09-05 11:36:41,336 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2019-09-05 11:36:46,752 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-09-05 11:36:47,626 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-05 11:36:48,101 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 91 [2019-09-05 11:36:48,294 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 96 [2019-09-05 11:36:48,728 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 93 [2019-09-05 11:36:48,933 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 98 [2019-09-05 11:36:49,208 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2019-09-05 11:36:49,412 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-05 11:36:49,670 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2019-09-05 11:36:49,874 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-05 11:36:50,152 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 91 [2019-09-05 11:36:50,369 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2019-09-05 11:36:50,636 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 93 [2019-09-05 11:36:50,846 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 98 [2019-09-05 11:36:51,133 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 93 [2019-09-05 11:36:51,370 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 98 [2019-09-05 11:36:51,674 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2019-09-05 11:36:52,108 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-05 11:36:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:52,109 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-09-05 11:36:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 11:36:52,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 137 [2019-09-05 11:36:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:52,111 INFO L225 Difference]: With dead ends: 157 [2019-09-05 11:36:52,111 INFO L226 Difference]: Without dead ends: 155 [2019-09-05 11:36:52,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 90 SyntacticMatches, 44 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=738, Invalid=8574, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 11:36:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-05 11:36:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2019-09-05 11:36:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 11:36:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-09-05 11:36:52,132 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 137 [2019-09-05 11:36:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:52,132 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-09-05 11:36:52,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 11:36:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-09-05 11:36:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-05 11:36:52,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:52,134 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:52,134 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash -493612982, now seen corresponding path program 15 times [2019-09-05 11:36:52,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:52,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:52,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 24 proven. 212 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-05 11:36:52,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:52,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:52,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:37:42,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:37:42,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:42,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:37:42,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 24 proven. 212 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-05 11:37:42,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:37:42,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2019-09-05 11:37:42,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:37:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:37:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:37:42,548 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 30 states. [2019-09-05 11:37:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:43,996 INFO L93 Difference]: Finished difference Result 339 states and 358 transitions. [2019-09-05 11:37:43,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:37:43,997 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 145 [2019-09-05 11:37:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:43,999 INFO L225 Difference]: With dead ends: 339 [2019-09-05 11:37:43,999 INFO L226 Difference]: Without dead ends: 167 [2019-09-05 11:37:44,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:37:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-05 11:37:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2019-09-05 11:37:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-05 11:37:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-09-05 11:37:44,019 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 145 [2019-09-05 11:37:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:44,020 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-09-05 11:37:44,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:37:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-09-05 11:37:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-05 11:37:44,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:44,021 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:44,021 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2070574798, now seen corresponding path program 16 times [2019-09-05 11:37:44,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:44,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:44,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:44,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:44,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:46,211 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-09-05 11:37:47,369 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2019-09-05 11:37:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 36 proven. 444 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-05 11:37:47,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:47,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:47,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:37:47,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:37:47,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:37:47,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-05 11:37:47,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:37:47,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:47,639 INFO L375 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 23 treesize of output 27 [2019-09-05 11:37:47,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:47,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:47,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:47,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-05 11:37:47,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:37:47,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:47,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:47,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:47,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-05 11:37:47,998 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:47,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,022 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-05 11:37:48,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:37:48,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:48,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,040 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:48,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,062 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-05 11:37:48,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:37:48,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:48,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-05 11:37:48,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,115 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-05 11:37:48,115 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_72| vanished before elimination [2019-09-05 11:37:48,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-05 11:37:48,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,150 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-05 11:37:48,150 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_73| vanished before elimination [2019-09-05 11:37:48,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,155 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:48,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,179 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-05 11:37:48,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:37:48,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:48,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-05 11:37:48,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,231 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-05 11:37:48,232 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_75| vanished before elimination [2019-09-05 11:37:48,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,237 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:48,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,259 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2019-09-05 11:37:48,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-05 11:37:48,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:48,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-09-05 11:37:48,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,314 INFO L567 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-09-05 11:37:48,314 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_77| vanished before elimination [2019-09-05 11:37:48,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:16 [2019-09-05 11:37:48,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-09-05 11:37:48,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:48,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-05 11:37:48,333 INFO L375 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 0 case distinctions, treesize of input 60 treesize of output 62 [2019-09-05 11:37:48,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,368 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-09-05 11:37:48,369 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_79| vanished before elimination [2019-09-05 11:37:48,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-09-05 11:37:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:48,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 88 [2019-09-05 11:37:48,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,505 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:48,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,539 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.2 percent of original size [2019-09-05 11:37:48,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:159, output treesize:68 [2019-09-05 11:37:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:48,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:48,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 120 [2019-09-05 11:37:48,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,734 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:48,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,787 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-09-05 11:37:48,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:48,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:205, output treesize:91 [2019-09-05 11:37:48,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:48,938 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:48,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:49,153 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-05 11:37:49,153 INFO L341 Elim1Store]: treesize reduction 96, result has 69.6 percent of original size [2019-09-05 11:37:49,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 123 treesize of output 346 [2019-09-05 11:37:49,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:49,239 INFO L567 ElimStorePlain]: treesize reduction 357, result has 24.2 percent of original size [2019-09-05 11:37:49,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:49,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:251, output treesize:114 [2019-09-05 11:37:49,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:49,423 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:49,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:49,868 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 115 [2019-09-05 11:37:49,868 INFO L341 Elim1Store]: treesize reduction 246, result has 57.9 percent of original size [2019-09-05 11:37:49,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 30 case distinctions, treesize of input 164 treesize of output 500 [2019-09-05 11:37:49,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:49,982 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2019-09-05 11:37:49,982 INFO L567 ElimStorePlain]: treesize reduction 565, result has 21.5 percent of original size [2019-09-05 11:37:49,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:49,983 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:333, output treesize:155 [2019-09-05 11:37:50,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:50,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:37:50,478 INFO L235 Elim1Store]: Index analysis took 256 ms [2019-09-05 11:37:50,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 48 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 216 [2019-09-05 11:37:50,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:50,491 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:50,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:50,563 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.0 percent of original size [2019-09-05 11:37:50,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:50,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:343, output treesize:160 [2019-09-05 11:37:50,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:50,806 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:50,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:51,760 WARN L188 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 175 [2019-09-05 11:37:51,761 INFO L341 Elim1Store]: treesize reduction 522, result has 52.0 percent of original size [2019-09-05 11:37:51,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 3 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 63 case distinctions, treesize of input 210 treesize of output 772 [2019-09-05 11:37:51,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:51,946 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 84 [2019-09-05 11:37:51,946 INFO L567 ElimStorePlain]: treesize reduction 953, result has 17.4 percent of original size [2019-09-05 11:37:51,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:51,947 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:425, output treesize:201 [2019-09-05 11:37:52,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:37:52,231 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:37:52,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:53,108 WARN L188 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 419 DAG size of output: 167 [2019-09-05 11:37:53,109 INFO L341 Elim1Store]: treesize reduction 720, result has 42.3 percent of original size [2019-09-05 11:37:53,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 3 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 84 case distinctions, treesize of input 215 treesize of output 746 [2019-09-05 11:37:53,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:53,314 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 90 [2019-09-05 11:37:53,314 INFO L567 ElimStorePlain]: treesize reduction 831, result has 19.9 percent of original size [2019-09-05 11:37:53,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:53,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:435, output treesize:206 [2019-09-05 11:37:54,208 WARN L188 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 522 DAG size of output: 43 [2019-09-05 11:37:54,208 INFO L341 Elim1Store]: treesize reduction 1372, result has 4.9 percent of original size [2019-09-05 11:37:54,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 26 select indices, 26 select index equivalence classes, 3 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 108 case distinctions, treesize of input 206 treesize of output 280 [2019-09-05 11:37:54,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:37:54,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:37:54,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:37:54,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:218, output treesize:214 [2019-09-05 11:37:56,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.offset_BEFORE_CALL_29| Int) (|v_main_~#C~0.base_BEFORE_CALL_29| Int) (|v_main_~#C~0.offset_BEFORE_CALL_29| Int) (|v_main_~#A~0.base_BEFORE_CALL_29| Int) (|v_main_~#B~0.base_BEFORE_CALL_29| Int) (|v_main_~#A~0.offset_BEFORE_CALL_29| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_29|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_29|)) (.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_29|))) (and (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 20)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 20)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 20)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_29| |v_main_~#B~0.base_BEFORE_CALL_29|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_29| |v_main_~#C~0.base_BEFORE_CALL_29|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 16)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 16)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 16)))) (= (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_29|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_29|)) (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_29|)) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 8))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 8))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 28)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 28)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 28)))) (= (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 4))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 32)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 32))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 32))) (not (= |v_main_~#B~0.base_BEFORE_CALL_29| |v_main_~#C~0.base_BEFORE_CALL_29|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 24)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 24)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 24)))) (= (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_29| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_29| 12))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_29| 12)))))) is different from true [2019-09-05 11:37:59,766 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_30| Int) (|v_main_~#A~0.offset_BEFORE_CALL_30| Int) (|v_main_~#B~0.offset_BEFORE_CALL_30| Int) (|v_main_~#C~0.offset_BEFORE_CALL_30| Int) (|v_main_~#C~0.base_BEFORE_CALL_30| Int) (|v_main_~#A~0.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_30|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_30|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_30|))) (and (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 4))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 4))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 16)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 16)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 16)))) (= (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 20)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 20))) (not (= |v_main_~#B~0.base_BEFORE_CALL_30| |v_main_~#C~0.base_BEFORE_CALL_30|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 28)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 28)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 28)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 24)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 24)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 24)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 12)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 12)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 12)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_30| |v_main_~#B~0.base_BEFORE_CALL_30|)) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 8))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_30| 32)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_30| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_30| 32))) (not (= |v_main_~#A~0.base_BEFORE_CALL_30| |v_main_~#C~0.base_BEFORE_CALL_30|)) (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_30|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_30|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_30|))))) is different from true [2019-09-05 11:38:02,881 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_31| Int) (|v_main_~#A~0.base_BEFORE_CALL_31| Int) (|v_main_~#A~0.offset_BEFORE_CALL_31| Int) (|v_main_~#B~0.offset_BEFORE_CALL_31| Int) (|v_main_~#C~0.base_BEFORE_CALL_31| Int) (|v_main_~#C~0.offset_BEFORE_CALL_31| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_31|)) (.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_31|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_31|))) (and (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 12)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 12))) (not (= |v_main_~#B~0.base_BEFORE_CALL_31| |v_main_~#C~0.base_BEFORE_CALL_31|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 16)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 16)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 16)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 8)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 8)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 8)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_31| |v_main_~#C~0.base_BEFORE_CALL_31|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 28)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 28)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 28)))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 20)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 20))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 32)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 32))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 24)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 24)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 24)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_31| |v_main_~#B~0.base_BEFORE_CALL_31|)) (= (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_31|) (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_31|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_31|))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_31| 4)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_31| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_31| 4))))))) is different from true [2019-09-05 11:38:05,990 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_32| Int) (|v_main_~#A~0.offset_BEFORE_CALL_32| Int) (|v_main_~#B~0.base_BEFORE_CALL_32| Int) (|v_main_~#B~0.offset_BEFORE_CALL_32| Int) (|v_main_~#C~0.base_BEFORE_CALL_32| Int) (|v_main_~#C~0.offset_BEFORE_CALL_32| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_32|)) (.cse2 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_32|)) (.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_32|))) (and (not (= |v_main_~#B~0.base_BEFORE_CALL_32| |v_main_~#C~0.base_BEFORE_CALL_32|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 28)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 28)) (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 28)))) (= (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 4))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 12)) (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 12)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 12)))) (= (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 20)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 20))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 20))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 16)) (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 16)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 16)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_32| |v_main_~#B~0.base_BEFORE_CALL_32|)) (= (+ (select .cse2 |v_main_~#B~0.offset_BEFORE_CALL_32|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_32|)) (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_32|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 24)) (+ (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 24)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 24)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_32| |v_main_~#C~0.base_BEFORE_CALL_32|)) (= (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 32)) (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 32))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 32))) (= (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_32| 8)) (select .cse2 (+ |v_main_~#B~0.offset_BEFORE_CALL_32| 8))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_32| 8)))))) is different from true [2019-09-05 11:38:09,111 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_33| Int) (|v_main_~#B~0.base_BEFORE_CALL_33| Int) (|v_main_~#C~0.base_BEFORE_CALL_33| Int) (|v_main_~#A~0.offset_BEFORE_CALL_33| Int) (|v_main_~#B~0.offset_BEFORE_CALL_33| Int) (|v_main_~#C~0.offset_BEFORE_CALL_33| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_33|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_33|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_33|))) (and (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 16)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 16))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 16))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 12)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 12))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 4)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 4)))) (not (= |v_main_~#B~0.base_BEFORE_CALL_33| |v_main_~#C~0.base_BEFORE_CALL_33|)) (= (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_33|) (+ (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_33|) (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_33|))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 24)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 24))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 24))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 8)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 8)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 8)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 20)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 20)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 20)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 28)) (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 28)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 28)))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_33| 32)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_33| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_33| 32))) (not (= |v_main_~#A~0.base_BEFORE_CALL_33| |v_main_~#C~0.base_BEFORE_CALL_33|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_33| |v_main_~#B~0.base_BEFORE_CALL_33|))))) is different from true [2019-09-05 11:38:12,309 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_34| Int) (|v_main_~#B~0.base_BEFORE_CALL_34| Int) (|v_main_~#C~0.base_BEFORE_CALL_34| Int) (|v_main_~#A~0.offset_BEFORE_CALL_34| Int) (|v_main_~#B~0.offset_BEFORE_CALL_34| Int) (|v_main_~#C~0.offset_BEFORE_CALL_34| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_34|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_34|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_34|))) (and (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 12))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 12))) (= (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_34|) (+ (select .cse0 |v_main_~#A~0.offset_BEFORE_CALL_34|) (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_34|))) (not (= |v_main_~#A~0.base_BEFORE_CALL_34| |v_main_~#C~0.base_BEFORE_CALL_34|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_34| |v_main_~#B~0.base_BEFORE_CALL_34|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 20)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 20))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 24)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 24)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 24)))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 32)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 32))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 32))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 16)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 16))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 16))) (not (= |v_main_~#B~0.base_BEFORE_CALL_34| |v_main_~#C~0.base_BEFORE_CALL_34|)) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 4)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 4))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 4))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 8)) (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 8))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 8))) (= (+ (select .cse0 (+ |v_main_~#A~0.offset_BEFORE_CALL_34| 28)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_34| 28))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_34| 28)))))) is different from true [2019-09-05 11:38:15,433 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#B~0.base_BEFORE_CALL_35| Int) (|v_main_~#A~0.base_BEFORE_CALL_35| Int) (|v_main_~#C~0.base_BEFORE_CALL_35| Int) (|v_main_~#C~0.offset_BEFORE_CALL_35| Int) (|v_main_~#A~0.offset_BEFORE_CALL_35| Int) (|v_main_~#B~0.offset_BEFORE_CALL_35| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_35|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_35|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_35|))) (and (not (= |v_main_~#B~0.base_BEFORE_CALL_35| |v_main_~#C~0.base_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 28)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 28)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 28)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 12)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 12)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 12)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_35| |v_main_~#B~0.base_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 16)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 16)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 16)))) (= (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 4))) (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 4))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 8)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 8)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 20)) (+ (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 20)) (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 20)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_35| |v_main_~#C~0.base_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 32)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 32)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 32)))) (= (+ (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_35|) (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_35|)) (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_35|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_35| 24)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_35| 24)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_35| 24))))))) is different from true [2019-09-05 11:38:20,417 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 99 [2019-09-05 11:38:23,737 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#A~0.base_BEFORE_CALL_36| Int) (|v_main_~#B~0.base_BEFORE_CALL_36| Int) (|v_main_~#B~0.offset_BEFORE_CALL_36| Int) (|v_main_~#C~0.base_BEFORE_CALL_36| Int) (|v_main_~#C~0.offset_BEFORE_CALL_36| Int) (|v_main_~#A~0.offset_BEFORE_CALL_36| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_36|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_36|)) (.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_36|))) (and (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_36|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_36|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_36|)) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 16)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 16))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 16))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 28)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 28)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 28)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 32)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 32)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 32)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_36| |v_main_~#B~0.base_BEFORE_CALL_36|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 4)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 4)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 4)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 12)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 12)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 12)))) (not (= |v_main_~#B~0.base_BEFORE_CALL_36| |v_main_~#C~0.base_BEFORE_CALL_36|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 8)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 8)))) (not (= |v_main_~#A~0.base_BEFORE_CALL_36| |v_main_~#C~0.base_BEFORE_CALL_36|)) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 24)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 24))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 24))) (= (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_36| 20)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_36| 20))) (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_36| 20)))))) is different from true [2019-09-05 11:38:24,795 INFO L341 Elim1Store]: treesize reduction 1248, result has 0.1 percent of original size [2019-09-05 11:38:24,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 27 select indices, 27 select index equivalence classes, 3 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 108 case distinctions, treesize of input 229 treesize of output 55 [2019-09-05 11:38:24,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:38:24,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:24,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:38:24,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:241, output treesize:5 [2019-09-05 11:38:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 127 not checked. [2019-09-05 11:38:25,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:38:25,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 51] total 78 [2019-09-05 11:38:25,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 11:38:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 11:38:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=4518, Unknown=9, NotChecked=1144, Total=6006 [2019-09-05 11:38:25,346 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 78 states. [2019-09-05 11:38:29,162 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-05 11:38:29,349 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-09-05 11:38:29,779 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-05 11:38:30,250 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-05 11:38:30,759 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2019-09-05 11:38:30,963 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-05 11:38:31,330 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2019-09-05 11:38:31,578 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2019-09-05 11:38:32,824 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 99 [2019-09-05 11:38:33,802 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 101 [2019-09-05 11:38:34,107 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 100 [2019-09-05 11:38:34,361 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 105 [2019-09-05 11:38:38,378 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2019-09-05 11:38:38,630 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2019-09-05 11:38:49,802 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-09-05 11:38:50,061 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2019-09-05 11:38:59,977 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-09-05 11:39:00,229 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 103 [2019-09-05 11:39:10,652 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-09-05 11:39:10,954 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-09-05 11:39:14,998 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2019-09-05 11:39:15,330 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-09-05 11:39:18,997 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2019-09-05 11:39:19,262 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2019-09-05 11:39:29,869 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 117 [2019-09-05 11:39:37,176 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-05 11:39:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:37,178 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2019-09-05 11:39:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 11:39:37,178 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-09-05 11:39:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:37,180 INFO L225 Difference]: With dead ends: 173 [2019-09-05 11:39:37,180 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 11:39:37,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 102 SyntacticMatches, 48 SemanticMatches, 116 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4787 ImplicationChecksByTransitivity, 84.5s TimeCoverageRelationStatistics Valid=828, Invalid=11185, Unknown=9, NotChecked=1784, Total=13806 [2019-09-05 11:39:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 11:39:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-09-05 11:39:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-05 11:39:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2019-09-05 11:39:37,205 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 153 [2019-09-05 11:39:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:37,205 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2019-09-05 11:39:37,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 11:39:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2019-09-05 11:39:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-05 11:39:37,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:37,206 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:37,207 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash -132225787, now seen corresponding path program 17 times [2019-09-05 11:39:37,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:37,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:37,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 27 proven. 270 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-05 11:39:38,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:38,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:38,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:41:15,381 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:41:15,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:15,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:41:15,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 27 proven. 270 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-05 11:41:15,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:15,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2019-09-05 11:41:15,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:41:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:41:15,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:41:15,964 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand 33 states. [2019-09-05 11:41:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:17,868 INFO L93 Difference]: Finished difference Result 374 states and 394 transitions. [2019-09-05 11:41:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:41:17,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 161 [2019-09-05 11:41:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:17,877 INFO L225 Difference]: With dead ends: 374 [2019-09-05 11:41:17,877 INFO L226 Difference]: Without dead ends: 183 [2019-09-05 11:41:17,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:41:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-05 11:41:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2019-09-05 11:41:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-05 11:41:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2019-09-05 11:41:17,909 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 161 [2019-09-05 11:41:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:17,909 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2019-09-05 11:41:17,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:41:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2019-09-05 11:41:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-05 11:41:17,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:17,912 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:17,912 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash -557520579, now seen corresponding path program 18 times [2019-09-05 11:41:17,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:17,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:17,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:17,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:17,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:19,233 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-05 11:41:19,876 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-09-05 11:41:20,819 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-09-05 11:41:21,989 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2019-09-05 11:41:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 18 proven. 552 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 11:41:22,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:22,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:22,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:42:37,696 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-05 11:42:37,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:37,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-05 11:42:37,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:37,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:42:37,783 INFO L375 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 23 treesize of output 27 [2019-09-05 11:42:37,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:42:37,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:42:37,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:42:37,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2019-09-05 11:42:37,827 INFO L375 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 0 case distinctions, treesize of input 72 treesize of output 74 [2019-09-05 11:42:37,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:42:37,907 INFO L567 ElimStorePlain]: treesize reduction 82, result has 43.4 percent of original size [2019-09-05 11:42:37,907 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_88| vanished before elimination [2019-09-05 11:42:37,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:42:37,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:149, output treesize:63 [2019-09-05 11:42:39,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:39,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:39,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:39,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:39,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:42:39,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:42:39,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:42:39,177 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:42:39,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:42:39,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:42:39,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 55 [2019-09-05 11:42:39,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:42:39,194 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:42:39,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:42:39,225 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.1 percent of original size [2019-09-05 11:42:39,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:42:39,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:208, output treesize:5 [2019-09-05 11:42:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 24 proven. 568 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-05 11:42:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 34 [2019-09-05 11:42:39,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:42:39,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:42:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:42:39,474 INFO L87 Difference]: Start difference. First operand 172 states and 175 transitions. Second operand 34 states. [2019-09-05 11:42:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:43,921 INFO L93 Difference]: Finished difference Result 189 states and 192 transitions. [2019-09-05 11:42:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:42:43,922 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 169 [2019-09-05 11:42:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:43,923 INFO L225 Difference]: With dead ends: 189 [2019-09-05 11:42:43,923 INFO L226 Difference]: Without dead ends: 187 [2019-09-05 11:42:43,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 139 SyntacticMatches, 66 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=294, Invalid=2898, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:42:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-05 11:42:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2019-09-05 11:42:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 11:42:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2019-09-05 11:42:43,946 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 169 [2019-09-05 11:42:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:43,947 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2019-09-05 11:42:43,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:42:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2019-09-05 11:42:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-05 11:42:43,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:43,948 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:43,949 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash 613611636, now seen corresponding path program 19 times [2019-09-05 11:42:43,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:43,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:43,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 30 proven. 335 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-05 11:42:44,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:44,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:44,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:44,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:42:44,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 30 proven. 335 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-05 11:42:45,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:45,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2019-09-05 11:42:45,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:42:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:42:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:42:45,637 INFO L87 Difference]: Start difference. First operand 180 states and 183 transitions. Second operand 36 states. [2019-09-05 11:42:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:48,023 INFO L93 Difference]: Finished difference Result 409 states and 430 transitions. [2019-09-05 11:42:48,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:42:48,025 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 177 [2019-09-05 11:42:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:48,027 INFO L225 Difference]: With dead ends: 409 [2019-09-05 11:42:48,027 INFO L226 Difference]: Without dead ends: 199 [2019-09-05 11:42:48,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:42:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-05 11:42:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2019-09-05 11:42:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-05 11:42:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 191 transitions. [2019-09-05 11:42:48,057 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 191 transitions. Word has length 177 [2019-09-05 11:42:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:48,057 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 191 transitions. [2019-09-05 11:42:48,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:42:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 191 transitions. [2019-09-05 11:42:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-05 11:42:48,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:48,059 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:48,059 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -409573256, now seen corresponding path program 20 times [2019-09-05 11:42:48,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:48,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:42:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:50,795 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2019-09-05 11:42:51,981 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 41 [2019-09-05 11:42:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 20 proven. 497 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-05 11:42:52,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:52,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:52,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:42:52,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:42:52,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:52,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-05 11:42:52,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:52,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:42:52,368 INFO L375 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 23 treesize of output 27 [2019-09-05 11:42:52,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:42:52,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:42:52,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:42:52,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-09-05 11:42:52,992 INFO L375 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 0 case distinctions, treesize of input 27 treesize of output 30 [2019-09-05 11:42:52,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:42:53,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:42:53,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:42:53,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42