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/loop-crafted/simple_array_index_value_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:46:52,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:46:52,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:46:52,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:46:52,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:46:52,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:46:52,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:46:52,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:46:52,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:46:52,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:46:52,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:46:52,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:46:52,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:46:52,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:46:52,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:46:52,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:46:52,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:46:52,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:46:52,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:46:52,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:46:52,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:46:52,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:46:52,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:46:52,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:46:52,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:46:52,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:46:52,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:46:52,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:46:52,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:46:52,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:46:52,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:46:52,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:46:52,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:46:52,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:46:52,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:46:52,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:46:52,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:46:52,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:46:52,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:46:52,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:46:52,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:46:52,709 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-03 19:46:52,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:46:52,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:46:52,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:46:52,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:46:52,724 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:46:52,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:46:52,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:46:52,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:46:52,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:46:52,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:46:52,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:46:52,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:46:52,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:46:52,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:46:52,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:46:52,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:46:52,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:46:52,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:46:52,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:46:52,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:46:52,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:46:52,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:46:52,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:46:52,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:46:52,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:46:52,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:46:52,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:46:52,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:46:52,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:46:52,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:46:52,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:46:52,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:46:52,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:46:52,794 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:46:52,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-09-03 19:46:52,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f587cbe/f61abf045c304ba590de84b05b562532/FLAGd86dbda35 [2019-09-03 19:46:53,270 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:46:53,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-09-03 19:46:53,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f587cbe/f61abf045c304ba590de84b05b562532/FLAGd86dbda35 [2019-09-03 19:46:53,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f587cbe/f61abf045c304ba590de84b05b562532 [2019-09-03 19:46:53,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:46:53,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:46:53,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:46:53,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:46:53,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:46:53,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:53,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f94b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53, skipping insertion in model container [2019-09-03 19:46:53,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:53,737 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:46:53,751 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:46:53,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:46:53,937 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:46:53,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:46:53,973 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:46:53,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53 WrapperNode [2019-09-03 19:46:53,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:46:53,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:46:53,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:46:53,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:46:54,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (1/1) ... [2019-09-03 19:46:54,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:46:54,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:46:54,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:46:54,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:46:54,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (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-03 19:46:54,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:46:54,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:46:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:46:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:46:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:46:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:46:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:46:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:46:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:46:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:46:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:46:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:46:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:46:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:46:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:46:54,359 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:46:54,359 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:46:54,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:46:54 BoogieIcfgContainer [2019-09-03 19:46:54,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:46:54,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:46:54,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:46:54,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:46:54,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:46:53" (1/3) ... [2019-09-03 19:46:54,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d11dd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:46:54, skipping insertion in model container [2019-09-03 19:46:54,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:46:53" (2/3) ... [2019-09-03 19:46:54,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d11dd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:46:54, skipping insertion in model container [2019-09-03 19:46:54,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:46:54" (3/3) ... [2019-09-03 19:46:54,388 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2019-09-03 19:46:54,411 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:46:54,426 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:46:54,453 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:46:54,476 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:46:54,476 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:46:54,477 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:46:54,477 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:46:54,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:46:54,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:46:54,477 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:46:54,477 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:46:54,477 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:46:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-03 19:46:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:46:54,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:46:54,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:46:54,498 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:46:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:46:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2019-09-03 19:46:54,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:46:54,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:46:54,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:54,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:54,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:54,617 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-03 19:46:54,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:46:54,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:46:54,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:46:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:46:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:46:54,638 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-03 19:46:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:46:54,661 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-09-03 19:46:54,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:46:54,662 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-03 19:46:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:46:54,670 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:46:54,670 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:46:54,673 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-03 19:46:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:46:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:46:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:46:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 19:46:54,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2019-09-03 19:46:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:46:54,710 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 19:46:54,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:46:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 19:46:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:46:54,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:46:54,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:46:54,712 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:46:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:46:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1443575666, now seen corresponding path program 1 times [2019-09-03 19:46:54,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:46:54,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:46:54,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:54,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:54,789 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-03 19:46:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:46:54,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:46:54,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:46:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:46:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:46:54,792 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2019-09-03 19:46:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:46:54,858 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-09-03 19:46:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:46:54,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 19:46:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:46:54,864 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:46:54,864 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:46:54,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:46:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:46:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-09-03 19:46:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:46:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 19:46:54,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2019-09-03 19:46:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:46:54,887 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 19:46:54,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:46:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 19:46:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:46:54,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:46:54,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:46:54,889 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:46:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:46:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash 31729808, now seen corresponding path program 1 times [2019-09-03 19:46:54,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:46:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:46:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:54,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:46:55,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:46:55,040 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:46:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:55,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:46:55,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:46:55,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-03 19:46:55,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:55,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:46:55,217 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-03 19:46:55,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-09-03 19:46:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:55,267 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:55,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:55,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:46:55,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2019-09-03 19:46:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:55,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:55,310 INFO L567 ElimStorePlain]: treesize reduction 21, result has 30.0 percent of original size [2019-09-03 19:46:55,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:46:55,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2019-09-03 19:46:55,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:46:55,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:46:55,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2019-09-03 19:46:55,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:46:55,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:46:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:46:55,366 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-09-03 19:46:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:46:55,544 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-03 19:46:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:46:55,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 19:46:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:46:55,547 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:46:55,547 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:46:55,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:46:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:46:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-09-03 19:46:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:46:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-03 19:46:55,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2019-09-03 19:46:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:46:55,565 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-03 19:46:55,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:46:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-03 19:46:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:46:55,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:46:55,567 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:46:55,568 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:46:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:46:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash -744847771, now seen corresponding path program 1 times [2019-09-03 19:46:55,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:46:55,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:46:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:55,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:46:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:46:55,735 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:46:55,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:55,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:46:55,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:46:55,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:46:55,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:55,872 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:46:55,872 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2019-09-03 19:46:55,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:46:55,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:46:56,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:56,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:46:56,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:46:56,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:46:56,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:56,082 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:56,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:56,116 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:46:56,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:46:56,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:46:56,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:46:56,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:46:56,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 12 [2019-09-03 19:46:56,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:46:56,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:46:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:46:56,196 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-09-03 19:46:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:46:59,236 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-09-03 19:46:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:46:59,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-09-03 19:46:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:46:59,238 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:46:59,239 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:46:59,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:46:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:46:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2019-09-03 19:46:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:46:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-09-03 19:46:59,249 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 25 [2019-09-03 19:46:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:46:59,249 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-09-03 19:46:59,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:46:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-09-03 19:46:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:46:59,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:46:59,251 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:46:59,251 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:46:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:46:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 344641978, now seen corresponding path program 2 times [2019-09-03 19:46:59,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:46:59,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:46:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:59,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:46:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:46:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:46:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:46:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:46:59,388 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-03 19:46:59,415 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-03 19:46:59,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:46:59,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:46:59,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:46:59,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:46:59,487 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:59,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:59,513 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-09-03 19:46:59,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:46:59,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:59,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:46:59,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:46:59,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:46:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:59,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:46:59,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:46:59,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:46:59,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:59,784 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:59,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:59,804 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:46:59,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:46:59,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:46:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:46:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:46:59,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 14 [2019-09-03 19:46:59,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:46:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:46:59,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:46:59,882 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-09-03 19:47:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:47:04,422 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-09-03 19:47:04,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:47:04,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-09-03 19:47:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:47:04,425 INFO L225 Difference]: With dead ends: 80 [2019-09-03 19:47:04,425 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:47:04,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:47:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:47:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-09-03 19:47:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:47:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-03 19:47:04,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 35 [2019-09-03 19:47:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:47:04,439 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-03 19:47:04,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:47:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-03 19:47:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:47:04,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:47:04,441 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:47:04,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:47:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:47:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash -579179889, now seen corresponding path program 3 times [2019-09-03 19:47:04,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:47:04,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:47:04,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:47:04,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:47:04,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:47:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:47:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:47:04,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:47:04,625 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-03 19:47:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:47:04,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:47:04,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:47:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:47:04,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:47:04,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:47:04,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:04,856 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:47:04,857 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2019-09-03 19:47:04,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:04,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:47:05,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:05,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:47:05,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:47:05,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:47:05,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:05,152 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:47:05,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:05,173 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:47:05,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:05,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:47:05,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:47:05,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:47:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 16 [2019-09-03 19:47:05,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:47:05,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:47:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:47:05,243 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2019-09-03 19:47:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:47:11,971 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-09-03 19:47:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:47:11,972 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-09-03 19:47:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:47:11,974 INFO L225 Difference]: With dead ends: 98 [2019-09-03 19:47:11,974 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 19:47:11,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:47:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 19:47:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-09-03 19:47:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:47:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-03 19:47:11,988 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 45 [2019-09-03 19:47:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:47:11,989 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-03 19:47:11,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:47:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-03 19:47:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:47:11,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:47:11,990 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:47:11,990 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:47:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:47:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2085179164, now seen corresponding path program 4 times [2019-09-03 19:47:11,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:47:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:47:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:47:11,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:47:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:47:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:47:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:47:12,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:47:12,120 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) [2019-09-03 19:47:12,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:47:12,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:47:12,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:47:12,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:47:12,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:47:12,192 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:47:12,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:12,215 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-09-03 19:47:12,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:47:12,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:12,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:47:12,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:12,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:47:12,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:12,900 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:47:12,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:12,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:47:12,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2019-09-03 19:47:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:12,917 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:12,959 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-09-03 19:47:12,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:12,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:47:12,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:47:13,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:47:13,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17] total 18 [2019-09-03 19:47:13,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:47:13,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:47:13,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:47:13,035 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 18 states. [2019-09-03 19:47:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:47:21,828 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2019-09-03 19:47:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:47:21,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-09-03 19:47:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:47:21,830 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:47:21,830 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 19:47:21,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:47:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 19:47:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-09-03 19:47:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 19:47:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-09-03 19:47:21,847 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 55 [2019-09-03 19:47:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:47:21,848 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-09-03 19:47:21,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:47:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-09-03 19:47:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 19:47:21,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:47:21,851 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:47:21,851 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:47:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:47:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash -820706119, now seen corresponding path program 5 times [2019-09-03 19:47:21,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:47:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:47:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:47:21,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:47:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:47:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:47:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-03 19:47:22,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:47:22,038 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:47:22,067 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:47:49,467 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:47:49,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:47:49,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:47:49,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:47:49,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:47:49,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:49,680 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:47:49,680 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_11| vanished before elimination [2019-09-03 19:47:49,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:49,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:47:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:50,351 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:47:50,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:47:50,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:47:50,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2019-09-03 19:47:50,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:50,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:50,362 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:50,390 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-09-03 19:47:50,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:47:50,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:47:50,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:47:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:47:50,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:47:50,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 20 [2019-09-03 19:47:50,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:47:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:47:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:47:50,526 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2019-09-03 19:48:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:01,291 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2019-09-03 19:48:01,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:48:01,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2019-09-03 19:48:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:01,293 INFO L225 Difference]: With dead ends: 134 [2019-09-03 19:48:01,293 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 19:48:01,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:48:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 19:48:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-09-03 19:48:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 19:48:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-03 19:48:01,308 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2019-09-03 19:48:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:01,308 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-03 19:48:01,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:48:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-03 19:48:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 19:48:01,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:01,310 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:01,310 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:01,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1343044082, now seen corresponding path program 6 times [2019-09-03 19:48:01,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:01,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:01,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:01,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 49 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 19:48:01,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:01,482 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) [2019-09-03 19:48:01,506 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:04,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-03 19:48:04,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:48:04,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:48:04,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:04,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:48:04,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:04,310 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:48:04,311 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-09-03 19:48:04,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:48:04,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:24 [2019-09-03 19:48:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:48:04,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:04,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2019-09-03 19:48:04,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:48:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:48:04,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:48:04,367 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 12 states. [2019-09-03 19:48:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:04,768 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2019-09-03 19:48:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:48:04,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-03 19:48:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:04,769 INFO L225 Difference]: With dead ends: 148 [2019-09-03 19:48:04,769 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:48:04,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:48:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:48:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2019-09-03 19:48:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:48:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-03 19:48:04,786 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 75 [2019-09-03 19:48:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:04,786 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-03 19:48:04,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:48:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-03 19:48:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 19:48:04,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:04,788 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:04,788 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1478325932, now seen corresponding path program 7 times [2019-09-03 19:48:04,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:04,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 19:48:04,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:04,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:04,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:04,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:48:05,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:05,027 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:48:05,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:05,050 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-09-03 19:48:05,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:48:05,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:05,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:48:05,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:05,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:48:05,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:05,112 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:48:05,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:05,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:48:05,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:48:05,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:05,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:05,135 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:05,185 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:48:05,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:05,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:05,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:48:05,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:06,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:06,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:48:06,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:48:06,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:48:06,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:06,388 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:48:06,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:06,408 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:48:06,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:06,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:48:06,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-03 19:48:06,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:06,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 23 [2019-09-03 19:48:06,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:48:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:48:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:48:06,504 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 23 states. [2019-09-03 19:48:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:22,696 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2019-09-03 19:48:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:48:22,696 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-09-03 19:48:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:22,698 INFO L225 Difference]: With dead ends: 158 [2019-09-03 19:48:22,698 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 19:48:22,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:48:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 19:48:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2019-09-03 19:48:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:48:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-03 19:48:22,735 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 77 [2019-09-03 19:48:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:22,735 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-03 19:48:22,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:48:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-03 19:48:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 19:48:22,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:22,737 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:22,737 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1863690239, now seen corresponding path program 8 times [2019-09-03 19:48:22,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:22,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 19:48:22,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:22,921 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) [2019-09-03 19:48:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:22,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:48:22,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:48:22,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:48:22,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:23,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:48:23,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:23,032 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:48:23,032 INFO L464 ElimStorePlain]: Eliminatee v_prenex_36 vanished before elimination [2019-09-03 19:48:23,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:23,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:48:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:23,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:48:23,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:48:23,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:23,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:23,098 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:23,105 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:48:23,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:23,158 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:48:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:23,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:23,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:48:23,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:24,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:24,207 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:48:24,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:24,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:48:24,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2019-09-03 19:48:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:24,217 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:24,240 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-09-03 19:48:24,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:24,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:48:24,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:48:24,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:24,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23] total 25 [2019-09-03 19:48:24,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:48:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:48:24,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:48:24,346 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 25 states. [2019-09-03 19:48:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:39,386 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2019-09-03 19:48:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:48:39,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-03 19:48:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:39,389 INFO L225 Difference]: With dead ends: 176 [2019-09-03 19:48:39,389 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 19:48:39,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 16 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:48:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 19:48:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-09-03 19:48:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:48:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-03 19:48:39,407 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 87 [2019-09-03 19:48:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:39,407 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-03 19:48:39,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:48:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-03 19:48:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 19:48:39,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:39,409 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:39,409 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1621378774, now seen corresponding path program 9 times [2019-09-03 19:48:39,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:39,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-03 19:48:39,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:39,582 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-03 19:48:39,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:49:16,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 19:49:16,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:16,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 19:49:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:16,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:49:16,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:16,687 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:49:16,688 INFO L464 ElimStorePlain]: Eliminatee v_prenex_46 vanished before elimination [2019-09-03 19:49:16,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:49:16,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:24 [2019-09-03 19:49:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 19:49:16,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:16,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-03 19:49:16,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:49:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:49:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:49:16,765 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 25 states. [2019-09-03 19:49:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:17,553 INFO L93 Difference]: Finished difference Result 190 states and 195 transitions. [2019-09-03 19:49:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:49:17,553 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-09-03 19:49:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:17,555 INFO L225 Difference]: With dead ends: 190 [2019-09-03 19:49:17,555 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 19:49:17,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:49:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 19:49:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2019-09-03 19:49:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 19:49:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-03 19:49:17,571 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2019-09-03 19:49:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:17,571 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-03 19:49:17,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:49:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-03 19:49:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-03 19:49:17,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:17,573 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:17,573 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash 289901812, now seen corresponding path program 10 times [2019-09-03 19:49:17,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:17,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:17,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:17,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 16 proven. 121 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-03 19:49:17,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:17,799 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-03 19:49:17,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:49:17,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:17,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:17,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:49:17,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:17,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:49:17,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:17,949 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:49:17,949 INFO L464 ElimStorePlain]: Eliminatee v_prenex_47 vanished before elimination [2019-09-03 19:49:17,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:49:17,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:49:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:17,997 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:49:17,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:18,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:49:18,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:49:18,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,018 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:49:18,073 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:49:18,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:49:18,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:49:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:49:18,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:49:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,167 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:49:18,174 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:49:18,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:18,238 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:49:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:18,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:49:18,241 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:49:18,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:19,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:19,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:19,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:49:19,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:19,884 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:49:19,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:19,905 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:49:19,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:49:19,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:49:19,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-03 19:49:20,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:20,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 28 [2019-09-03 19:49:20,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:49:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:49:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:49:20,066 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 28 states. [2019-09-03 19:49:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:38,765 INFO L93 Difference]: Finished difference Result 200 states and 206 transitions. [2019-09-03 19:49:38,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:49:38,766 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2019-09-03 19:49:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:38,768 INFO L225 Difference]: With dead ends: 200 [2019-09-03 19:49:38,768 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 19:49:38,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 19 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:49:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 19:49:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2019-09-03 19:49:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:49:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 19:49:38,785 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 99 [2019-09-03 19:49:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:38,786 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 19:49:38,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:49:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 19:49:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 19:49:38,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:38,787 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:38,788 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1975081929, now seen corresponding path program 11 times [2019-09-03 19:49:38,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:38,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:38,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 19:49:39,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:39,026 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) [2019-09-03 19:49:39,050 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:18,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:51:18,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:18,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:51:18,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:18,659 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:51:18,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:51:18,682 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-09-03 19:51:18,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:51:18,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:51:18,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:51:18,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:51:18,708 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:51:18,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:51:18,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:51:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,769 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:51:18,772 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:51:18,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:51:18,821 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:51:18,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:51:18,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:51:18,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:51:18,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:51:18,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,920 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:51:18,923 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:51:18,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:51:18,970 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:51:18,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:51:18,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:51:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:20,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:51:20,596 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:51:20,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:51:20,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:51:20,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:51:20,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:51:20,626 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:51:20,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:51:20,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:51:20,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-03 19:51:20,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:20,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 30 [2019-09-03 19:51:20,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:51:20,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:51:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:51:20,773 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 30 states. [2019-09-03 19:51:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:41,231 INFO L93 Difference]: Finished difference Result 218 states and 224 transitions. [2019-09-03 19:51:41,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:51:41,231 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 109 [2019-09-03 19:51:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:41,233 INFO L225 Difference]: With dead ends: 218 [2019-09-03 19:51:41,233 INFO L226 Difference]: Without dead ends: 137 [2019-09-03 19:51:41,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 21 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:51:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-03 19:51:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2019-09-03 19:51:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 19:51:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-03 19:51:41,263 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 109 [2019-09-03 19:51:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:41,264 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-03 19:51:41,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:51:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-03 19:51:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 19:51:41,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:41,265 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:41,265 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash 420337694, now seen corresponding path program 12 times [2019-09-03 19:51:41,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:41,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:41,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 20 proven. 169 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 19:51:41,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:41,493 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:41,510 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:01,452 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-03 19:53:01,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:01,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:53:01,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 19:53:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:01,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:53:01,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:53:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:53:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:01,556 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 17 states. [2019-09-03 19:53:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:02,288 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2019-09-03 19:53:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:53:02,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-03 19:53:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:02,290 INFO L225 Difference]: With dead ends: 232 [2019-09-03 19:53:02,290 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:53:02,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:53:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2019-09-03 19:53:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 19:53:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-09-03 19:53:02,309 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2019-09-03 19:53:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:02,309 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-09-03 19:53:02,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:53:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-09-03 19:53:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 19:53:02,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:02,310 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:02,310 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1624730692, now seen corresponding path program 13 times [2019-09-03 19:53:02,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:02,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:02,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 20 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 19:53:02,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:02,578 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-03 19:53:02,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:02,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:53:02,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:02,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:53:02,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:02,714 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:53:02,714 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_24| vanished before elimination [2019-09-03 19:53:02,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:02,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:53:02,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:02,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:53:02,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,773 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:02,777 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:02,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:02,825 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:53:02,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:02,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:53:02,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:02,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:53:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,905 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:02,913 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:02,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:02,958 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:53:02,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:02,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:02,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:53:02,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:03,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:03,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:03,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:53:03,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:03,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:03,039 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:03,042 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:03,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:03,093 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:53:03,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:03,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:03,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:53:03,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:05,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:05,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:53:05,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:53:05,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:53:05,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:05,412 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:05,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:05,440 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:53:05,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:05,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:53:05,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 404 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-03 19:53:05,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:05,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29] total 33 [2019-09-03 19:53:05,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:53:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:53:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:53:05,599 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 33 states. [2019-09-03 19:53:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:30,126 INFO L93 Difference]: Finished difference Result 242 states and 249 transitions. [2019-09-03 19:53:30,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:53:30,126 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 121 [2019-09-03 19:53:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:30,128 INFO L225 Difference]: With dead ends: 242 [2019-09-03 19:53:30,128 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 19:53:30,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 82 SyntacticMatches, 24 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:53:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 19:53:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2019-09-03 19:53:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 19:53:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-03 19:53:30,147 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 121 [2019-09-03 19:53:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:30,147 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-03 19:53:30,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:53:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-03 19:53:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-03 19:53:30,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:30,148 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:30,149 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1485983727, now seen corresponding path program 14 times [2019-09-03 19:53:30,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:30,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:30,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 22 proven. 225 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-03 19:53:30,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:30,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:30,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:30,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:30,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:30,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:53:30,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:30,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-09-03 19:53:30,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:30,637 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-09-03 19:53:30,638 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_28| vanished before elimination [2019-09-03 19:53:30,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:30,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:53:30,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,680 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:30,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:30,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:30,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:53:30,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,701 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:30,749 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:53:30,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:30,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:53:30,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:30,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:53:30,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,839 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:30,842 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:30,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:30,887 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:53:30,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:30,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:53:30,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:30,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:53:30,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:30,972 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:30,975 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:30,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:31,027 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:53:31,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:31,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:31,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:53:31,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:34,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:34,016 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:53:34,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:53:34,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:53:34,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2019-09-03 19:53:34,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:34,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:34,025 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:34,051 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-09-03 19:53:34,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:53:34,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:53:34,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-03 19:53:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 31] total 35 [2019-09-03 19:53:34,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:53:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:53:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:53:34,224 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 35 states. [2019-09-03 19:53:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:59,371 INFO L93 Difference]: Finished difference Result 260 states and 267 transitions. [2019-09-03 19:53:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:53:59,372 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 131 [2019-09-03 19:53:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:59,374 INFO L225 Difference]: With dead ends: 260 [2019-09-03 19:53:59,374 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:53:59,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 90 SyntacticMatches, 26 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:53:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:53:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 144. [2019-09-03 19:53:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 19:53:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 19:53:59,396 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 131 [2019-09-03 19:53:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:59,397 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 19:53:59,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:53:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 19:53:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 19:53:59,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:59,398 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:59,398 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 655563238, now seen corresponding path program 15 times [2019-09-03 19:53:59,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:59,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 24 proven. 256 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-03 19:53:59,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:59,717 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-03 19:53:59,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:15,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 19:56:15,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:15,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:56:15,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-03 19:56:16,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:16,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:56:16,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:56:16,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:56:16,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:56:16,048 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 20 states. [2019-09-03 19:56:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:17,137 INFO L93 Difference]: Finished difference Result 274 states and 281 transitions. [2019-09-03 19:56:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:56:17,140 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 141 [2019-09-03 19:56:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:17,141 INFO L225 Difference]: With dead ends: 274 [2019-09-03 19:56:17,142 INFO L226 Difference]: Without dead ends: 169 [2019-09-03 19:56:17,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:56:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-03 19:56:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 146. [2019-09-03 19:56:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 19:56:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-03 19:56:17,162 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 141 [2019-09-03 19:56:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:17,162 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-03 19:56:17,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:56:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-03 19:56:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:56:17,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:17,163 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:17,163 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1019467004, now seen corresponding path program 16 times [2019-09-03 19:56:17,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:17,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 24 proven. 289 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-03 19:56:17,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:17,501 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-03 19:56:17,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:17,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:17,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:17,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:56:17,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:17,616 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:56:17,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:17,640 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-09-03 19:56:17,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:56:17,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:17,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:56:17,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:17,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:56:17,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,696 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:56:17,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:17,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:56:17,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:56:17,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,735 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:17,792 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:56:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:17,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:56:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,876 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:56:17,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:17,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:56:17,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:56:17,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,896 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:17,949 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:56:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:17,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:56:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:56:18,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:56:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,040 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:18,044 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:56:18,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:18,094 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:56:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:18,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:56:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,157 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:56:18,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:18,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:56:18,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:56:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,178 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:18,231 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:56:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:18,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:18,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:56:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:22,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:22,231 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:56:22,232 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:56:22,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:56:22,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:22,236 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:56:22,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:56:22,257 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:56:22,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:56:22,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:56:22,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 0 proven. 581 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-09-03 19:56:22,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:22,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 33] total 38 [2019-09-03 19:56:22,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:56:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:56:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:56:22,461 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 38 states. [2019-09-03 19:56:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:46,713 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-09-03 19:56:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:56:46,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-09-03 19:56:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:46,715 INFO L225 Difference]: With dead ends: 284 [2019-09-03 19:56:46,715 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 19:56:46,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 99 SyntacticMatches, 29 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=210, Invalid=1860, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:56:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 19:56:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 156. [2019-09-03 19:56:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 19:56:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-09-03 19:56:46,739 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 143 [2019-09-03 19:56:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:46,739 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-09-03 19:56:46,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:56:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-09-03 19:56:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 19:56:46,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:46,740 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:46,740 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash -679807783, now seen corresponding path program 17 times [2019-09-03 19:56:46,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:46,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:46,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:46,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:46,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 26 proven. 324 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 19:56:47,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:47,389 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) [2019-09-03 19:56:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:21,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:59:21,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:21,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 19:59:21,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:22,012 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:59:22,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:22,035 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-09-03 19:59:22,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-09-03 19:59:22,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:22,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:59:22,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-09-03 19:59:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:59:22,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:59:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,113 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,125 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:59:22,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:22,183 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:59:22,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,185 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:59:22,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:59:22,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:59:22,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,325 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,328 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:59:22,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:22,378 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:59:22,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:59:22,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,445 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:59:22,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:22,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:59:22,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:59:22,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,465 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,516 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:59:22,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:59:22,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:59:22,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 103 [2019-09-03 19:59:22,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,609 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,612 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:59:22,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:22,665 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-09-03 19:59:22,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:22,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-09-03 19:59:22,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:25,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:25,815 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:59:25,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:59:25,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-09-03 19:59:25,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:25,820 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:59:25,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:59:25,839 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-09-03 19:59:25,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:59:25,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-09-03 19:59:25,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 668 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-03 19:59:26,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:26,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 35] total 40 [2019-09-03 19:59:26,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:59:26,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:59:26,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:59:26,069 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 40 states. [2019-09-03 19:59:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:52,228 INFO L93 Difference]: Finished difference Result 302 states and 310 transitions. [2019-09-03 19:59:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:59:52,228 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 153 [2019-09-03 19:59:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:52,231 INFO L225 Difference]: With dead ends: 302 [2019-09-03 19:59:52,231 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 19:59:52,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 104 SyntacticMatches, 31 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:59:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 19:59:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 166. [2019-09-03 19:59:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 19:59:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-03 19:59:52,254 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 153 [2019-09-03 19:59:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:52,255 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-03 19:59:52,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:59:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-03 19:59:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-03 19:59:52,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:52,256 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:52,256 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1776309202, now seen corresponding path program 18 times [2019-09-03 19:59:52,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:52,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:52,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 28 proven. 361 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-03 19:59:52,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:52,643 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-03 19:59:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE