java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 15:45:52,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:45:52,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:45:52,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:45:52,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:45:52,679 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:45:52,680 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:45:52,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:45:52,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:45:52,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:45:52,686 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:45:52,686 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:45:52,687 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:45:52,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:45:52,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:45:52,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:45:52,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:45:52,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:45:52,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:45:52,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:45:52,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:45:52,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:45:52,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:45:52,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:45:52,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:45:52,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:45:52,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:45:52,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:45:52,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:45:52,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:45:52,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:45:52,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:45:52,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:45:52,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:45:52,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:45:52,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:45:52,724 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 15:45:52,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:45:52,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:45:52,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:45:52,756 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:45:52,757 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:45:52,757 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:45:52,757 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:45:52,757 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:45:52,757 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:45:52,758 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:45:52,758 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:45:52,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:45:52,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:45:52,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:45:52,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:45:52,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:45:52,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:45:52,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:45:52,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:45:52,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:45:52,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:45:52,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:45:52,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:45:52,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:45:52,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:45:52,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:45:52,762 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:45:52,762 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:45:52,762 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:45:52,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:45:52,763 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:45:52,763 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:45:52,763 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:45:52,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:45:52,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:45:52,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:45:52,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:45:52,845 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:45:52,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-09-14 15:45:53,230 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689e16712/e589548b6e0547c08af2714a520d840c/FLAG09f72faef [2018-09-14 15:45:53,405 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:45:53,406 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-09-14 15:45:53,412 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689e16712/e589548b6e0547c08af2714a520d840c/FLAG09f72faef [2018-09-14 15:45:53,429 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689e16712/e589548b6e0547c08af2714a520d840c [2018-09-14 15:45:53,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:45:53,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:45:53,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:45:53,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:45:53,453 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:45:53,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1119bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53, skipping insertion in model container [2018-09-14 15:45:53,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,470 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:45:53,710 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:45:53,731 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:45:53,745 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:45:53,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53 WrapperNode [2018-09-14 15:45:53,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:45:53,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:45:53,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:45:53,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:45:53,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:45:53,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:45:53,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:45:53,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:45:53,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (1/1) ... [2018-09-14 15:45:53,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:45:53,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:45:53,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:45:53,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:45:53,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45: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 [2018-09-14 15:45:53,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:45:53,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:45:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:45:53,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:45:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:45:53,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:45:53,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-14 15:45:53,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-14 15:45:54,431 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:45:54,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:45:54 BoogieIcfgContainer [2018-09-14 15:45:54,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:45:54,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:45:54,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:45:54,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:45:54,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:45:53" (1/3) ... [2018-09-14 15:45:54,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4b1388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:45:54, skipping insertion in model container [2018-09-14 15:45:54,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:45:53" (2/3) ... [2018-09-14 15:45:54,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4b1388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:45:54, skipping insertion in model container [2018-09-14 15:45:54,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:45:54" (3/3) ... [2018-09-14 15:45:54,440 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-09-14 15:45:54,450 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:45:54,458 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:45:54,514 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:45:54,515 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:45:54,515 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:45:54,516 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:45:54,516 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:45:54,516 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:45:54,516 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:45:54,517 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:45:54,517 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:45:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-14 15:45:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-14 15:45:54,542 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:54,544 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:45:54,545 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1728315421, now seen corresponding path program 1 times [2018-09-14 15:45:54,553 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,603 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:45:54,666 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:45:54,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-14 15:45:54,667 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:54,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-14 15:45:54,688 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-14 15:45:54,689 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-14 15:45:54,692 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-09-14 15:45:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:54,721 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-09-14 15:45:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-14 15:45:54,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-09-14 15:45:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:54,733 INFO L225 Difference]: With dead ends: 48 [2018-09-14 15:45:54,734 INFO L226 Difference]: Without dead ends: 24 [2018-09-14 15:45:54,738 INFO L604 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 [2018-09-14 15:45:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-14 15:45:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-14 15:45:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-14 15:45:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-09-14 15:45:54,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-09-14 15:45:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:54,781 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-09-14 15:45:54,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-14 15:45:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-09-14 15:45:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-14 15:45:54,782 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:54,782 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:45:54,783 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 374890024, now seen corresponding path program 1 times [2018-09-14 15:45:54,783 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:54,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:54,785 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:45:55,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:45:55,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 15:45:55,061 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:55,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 15:45:55,063 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 15:45:55,063 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-14 15:45:55,063 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2018-09-14 15:45:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:55,249 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-09-14 15:45:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:45:55,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-14 15:45:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:55,251 INFO L225 Difference]: With dead ends: 39 [2018-09-14 15:45:55,251 INFO L226 Difference]: Without dead ends: 27 [2018-09-14 15:45:55,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:45:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-14 15:45:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-14 15:45:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-14 15:45:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-14 15:45:55,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-09-14 15:45:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:55,261 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-14 15:45:55,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 15:45:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-14 15:45:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-14 15:45:55,263 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:55,263 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:45:55,263 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 770504109, now seen corresponding path program 1 times [2018-09-14 15:45:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:55,265 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:55,658 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-09-14 15:45:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:45:55,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:55,680 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:45:55,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:55,707 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:55,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:55,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:56,011 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 15:45:56,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 10 [2018-09-14 15:45:56,011 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:45:56,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:45:56,012 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:45:56,013 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-14 15:45:56,013 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-14 15:45:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:56,205 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-09-14 15:45:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 15:45:56,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-14 15:45:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:56,209 INFO L225 Difference]: With dead ends: 54 [2018-09-14 15:45:56,209 INFO L226 Difference]: Without dead ends: 34 [2018-09-14 15:45:56,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-14 15:45:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-14 15:45:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-09-14 15:45:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-14 15:45:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-09-14 15:45:56,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2018-09-14 15:45:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:56,222 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-09-14 15:45:56,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:45:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-09-14 15:45:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-14 15:45:56,224 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:56,224 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:45:56,224 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash -628173915, now seen corresponding path program 1 times [2018-09-14 15:45:56,225 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:56,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:56,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:56,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:56,226 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:56,530 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-09-14 15:45:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:56,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:56,595 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:45:56,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:56,610 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:56,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:56,773 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:45:56,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:56,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-09-14 15:45:56,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:56,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:45:56,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:22 [2018-09-14 15:45:57,148 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-09-14 15:45:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:57,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:57,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-09-14 15:45:57,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:57,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-14 15:45:57,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:58,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:45:58,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-14 15:45:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:58,181 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:58,181 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:45:58,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:58,198 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:45:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:58,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:58,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-09-14 15:45:58,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:58,236 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:45:58,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:58,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:45:58,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:22 [2018-09-14 15:45:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:58,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:45:58,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-14 15:45:58,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:58,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-09-14 15:45:58,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:58,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:45:58,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-14 15:45:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:58,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:45:58,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9, 9, 9] total 19 [2018-09-14 15:45:58,639 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:45:58,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:45:58,640 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:45:58,641 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-09-14 15:45:58,642 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-09-14 15:45:59,071 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-09-14 15:45:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:45:59,288 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-09-14 15:45:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 15:45:59,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-14 15:45:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:45:59,291 INFO L225 Difference]: With dead ends: 44 [2018-09-14 15:45:59,291 INFO L226 Difference]: Without dead ends: 32 [2018-09-14 15:45:59,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-09-14 15:45:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-14 15:45:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-09-14 15:45:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-14 15:45:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-09-14 15:45:59,299 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2018-09-14 15:45:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:45:59,299 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-09-14 15:45:59,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:45:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-09-14 15:45:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-14 15:45:59,300 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:45:59,301 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:45:59,301 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:45:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1419824368, now seen corresponding path program 2 times [2018-09-14 15:45:59,301 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:45:59,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:59,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:45:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:45:59,303 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:45:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:45:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:45:59,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:45:59,560 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:45:59,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:45:59,569 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:45:59,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:45:59,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:45:59,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:45:59,698 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:45:59,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:59,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:45:59,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:45:59,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:45:59,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-09-14 15:46:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:46:00,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:00,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-14 15:46:00,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:00,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-09-14 15:46:00,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:00,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:46:00,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-14 15:46:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:46:01,227 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:01,227 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:01,244 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:01,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:01,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:01,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:46:01,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:46:01,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:01,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11, 7, 7] total 33 [2018-09-14 15:46:01,833 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:01,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 15:46:01,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 15:46:01,834 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2018-09-14 15:46:01,835 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 15 states. [2018-09-14 15:46:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:02,583 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-09-14 15:46:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 15:46:02,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-14 15:46:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:02,585 INFO L225 Difference]: With dead ends: 47 [2018-09-14 15:46:02,585 INFO L226 Difference]: Without dead ends: 35 [2018-09-14 15:46:02,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=259, Invalid=1073, Unknown=0, NotChecked=0, Total=1332 [2018-09-14 15:46:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-14 15:46:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-14 15:46:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-14 15:46:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-09-14 15:46:02,594 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2018-09-14 15:46:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:02,594 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-09-14 15:46:02,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-14 15:46:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-09-14 15:46:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-14 15:46:02,595 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:02,595 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:02,596 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1813047355, now seen corresponding path program 3 times [2018-09-14 15:46:02,596 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:02,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:02,597 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:46:02,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:02,969 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:46:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:02,979 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:03,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-14 15:46:03,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:03,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:46:03,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:03,339 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:03,339 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:03,356 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:03,387 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-14 15:46:03,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:03,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:46:03,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:46:03,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:03,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 8, 4, 4] total 17 [2018-09-14 15:46:03,450 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:03,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 15:46:03,451 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 15:46:03,451 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-14 15:46:03,451 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-09-14 15:46:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:04,062 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-09-14 15:46:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 15:46:04,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-09-14 15:46:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:04,065 INFO L225 Difference]: With dead ends: 84 [2018-09-14 15:46:04,065 INFO L226 Difference]: Without dead ends: 60 [2018-09-14 15:46:04,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-09-14 15:46:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-14 15:46:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2018-09-14 15:46:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-14 15:46:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-09-14 15:46:04,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 29 [2018-09-14 15:46:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:04,077 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-09-14 15:46:04,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 15:46:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-09-14 15:46:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-14 15:46:04,078 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:04,078 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:04,078 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 61056232, now seen corresponding path program 4 times [2018-09-14 15:46:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:04,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:04,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:04,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:04,080 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:04,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:04,395 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:46:04,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:46:04,410 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:46:04,452 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:46:04,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:04,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:04,718 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-14 15:46:04,997 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:46:04,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:05,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:46:05,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:05,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:05,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-09-14 15:46:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:05,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:05,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-09-14 15:46:05,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:05,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-14 15:46:05,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:05,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:46:05,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-14 15:46:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:06,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:06,552 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:06,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:46:06,572 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:46:06,615 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:46:06,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:06,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:07,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:07,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:07,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15, 11, 9] total 50 [2018-09-14 15:46:07,768 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:07,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-14 15:46:07,768 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-14 15:46:07,769 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2098, Unknown=0, NotChecked=0, Total=2450 [2018-09-14 15:46:07,770 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 22 states. [2018-09-14 15:46:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:09,841 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-09-14 15:46:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-14 15:46:09,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2018-09-14 15:46:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:09,843 INFO L225 Difference]: With dead ends: 83 [2018-09-14 15:46:09,843 INFO L226 Difference]: Without dead ends: 71 [2018-09-14 15:46:09,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 100 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=609, Invalid=3051, Unknown=0, NotChecked=0, Total=3660 [2018-09-14 15:46:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-14 15:46:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-09-14 15:46:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-14 15:46:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-09-14 15:46:09,858 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 35 [2018-09-14 15:46:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:09,858 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-09-14 15:46:09,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-14 15:46:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-09-14 15:46:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-14 15:46:09,859 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:09,859 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:09,860 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1491810029, now seen corresponding path program 5 times [2018-09-14 15:46:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:09,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:09,861 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-14 15:46:10,145 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:10,145 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:46:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:46:10,158 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:10,175 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-14 15:46:10,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:10,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:10,537 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:46:10,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:10,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:46:10,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:10,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:10,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-09-14 15:46:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-14 15:46:10,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:11,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-09-14 15:46:11,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:11,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-14 15:46:11,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:11,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:46:11,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-14 15:46:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:46:12,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:12,055 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:12,070 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:46:12,071 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:12,213 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-14 15:46:12,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:12,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-14 15:46:12,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-14 15:46:13,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:13,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 17, 5, 6] total 44 [2018-09-14 15:46:13,123 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:13,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-14 15:46:13,124 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-14 15:46:13,125 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2018-09-14 15:46:13,125 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 22 states. [2018-09-14 15:46:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:13,988 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-09-14 15:46:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-14 15:46:13,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-09-14 15:46:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:13,990 INFO L225 Difference]: With dead ends: 115 [2018-09-14 15:46:13,990 INFO L226 Difference]: Without dead ends: 76 [2018-09-14 15:46:13,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=311, Invalid=1945, Unknown=0, NotChecked=0, Total=2256 [2018-09-14 15:46:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-14 15:46:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2018-09-14 15:46:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-14 15:46:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-09-14 15:46:14,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 38 [2018-09-14 15:46:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:14,006 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-09-14 15:46:14,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-14 15:46:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-09-14 15:46:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-14 15:46:14,008 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:14,008 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:14,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1506953287, now seen corresponding path program 1 times [2018-09-14 15:46:14,009 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:14,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:14,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:14,010 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-14 15:46:14,438 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:14,438 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:46:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:14,446 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:46:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:14,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:14,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:46:14,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:46:14,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:14,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:46:14,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:55 [2018-09-14 15:46:15,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-14 15:46:15,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:15,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:15,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:36 [2018-09-14 15:46:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:46:15,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:16,408 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:16,409 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,410 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-09-14 15:46:16,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:16,465 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:16,466 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,467 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:16,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-09-14 15:46:16,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:16,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-09-14 15:46:16,673 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:16,715 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-09-14 15:46:16,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2018-09-14 15:46:16,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:16,821 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:16,834 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:16,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-09-14 15:46:16,836 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:17,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:46:17,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-09-14 15:46:17,367 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-09-14 15:46:17,370 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:17,371 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:17,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-09-14 15:46:17,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:17,376 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:17,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 42 [2018-09-14 15:46:17,387 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:17,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-14 15:46:17,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:46:17,519 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:137, output treesize:119 [2018-09-14 15:46:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:46:18,297 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:18,297 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:18,312 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:46:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:18,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-14 15:46:18,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-14 15:46:19,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:19,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24, 21, 6, 7] total 53 [2018-09-14 15:46:19,224 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:19,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-14 15:46:19,224 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-14 15:46:19,227 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2439, Unknown=0, NotChecked=0, Total=2756 [2018-09-14 15:46:19,227 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 29 states. [2018-09-14 15:46:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:21,624 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2018-09-14 15:46:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-14 15:46:21,624 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-09-14 15:46:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:21,626 INFO L225 Difference]: With dead ends: 150 [2018-09-14 15:46:21,626 INFO L226 Difference]: Without dead ends: 103 [2018-09-14 15:46:21,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=460, Invalid=3200, Unknown=0, NotChecked=0, Total=3660 [2018-09-14 15:46:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-14 15:46:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-09-14 15:46:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-14 15:46:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-09-14 15:46:21,644 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 50 [2018-09-14 15:46:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:21,644 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-09-14 15:46:21,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-14 15:46:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-09-14 15:46:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-14 15:46:21,646 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:21,646 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:21,646 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash 559942568, now seen corresponding path program 6 times [2018-09-14 15:46:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:46:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:21,648 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-09-14 15:46:22,074 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:22,074 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:46:22,081 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-14 15:46:22,081 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-14 15:46:22,137 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-14 15:46:22,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:22,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 49 proven. 51 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-14 15:46:22,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-14 15:46:23,934 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 15:46:23,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 14] total 30 [2018-09-14 15:46:23,935 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:46:23,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:46:23,935 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:46:23,936 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2018-09-14 15:46:23,936 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 12 states. [2018-09-14 15:46:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:24,548 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-09-14 15:46:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 15:46:24,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-09-14 15:46:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:24,551 INFO L225 Difference]: With dead ends: 128 [2018-09-14 15:46:24,551 INFO L226 Difference]: Without dead ends: 105 [2018-09-14 15:46:24,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2018-09-14 15:46:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-14 15:46:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2018-09-14 15:46:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-14 15:46:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-14 15:46:24,568 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 53 [2018-09-14 15:46:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:24,569 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-14 15:46:24,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:46:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-14 15:46:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-14 15:46:24,570 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:24,570 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:24,570 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash -539553683, now seen corresponding path program 2 times [2018-09-14 15:46:24,571 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:24,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:24,572 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-14 15:46:24,854 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:24,854 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:46:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:24,861 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:24,884 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:24,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:24,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:25,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:46:25,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-14 15:46:25,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:46:25,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:55 [2018-09-14 15:46:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:25,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-09-14 15:46:25,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,523 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:25,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-09-14 15:46:25,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:46:25,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-09-14 15:46:25,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-09-14 15:46:25,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:25,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:45 [2018-09-14 15:46:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-14 15:46:27,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:28,873 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:28,878 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:28,880 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:28,880 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:28,880 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:28,881 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:28,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 95 [2018-09-14 15:46:28,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:28,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-09-14 15:46:28,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:28,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-09-14 15:46:29,050 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,051 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 79 [2018-09-14 15:46:29,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-09-14 15:46:29,082 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-09-14 15:46:29,088 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:29,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-14 15:46:29,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:46:29,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,367 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:29,368 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,368 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,369 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:29,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 93 [2018-09-14 15:46:29,384 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:29,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-09-14 15:46:29,515 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-09-14 15:46:29,571 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,572 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,572 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,574 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2018-09-14 15:46:29,576 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:29,579 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,582 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:29,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 73 [2018-09-14 15:46:29,612 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-09-14 15:46:29,694 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-14 15:46:29,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:46:29,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-14 15:46:29,945 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:173, output treesize:413 [2018-09-14 15:46:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-14 15:46:30,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:30,484 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:46:30,500 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:46:30,583 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:46:30,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:30,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-14 15:46:31,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-14 15:46:32,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:46:32,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 26, 23, 7, 8] total 63 [2018-09-14 15:46:32,161 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:46:32,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-14 15:46:32,162 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-14 15:46:32,163 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3535, Unknown=0, NotChecked=0, Total=3906 [2018-09-14 15:46:32,163 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2018-09-14 15:46:34,276 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-09-14 15:46:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:46:35,671 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-09-14 15:46:35,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-14 15:46:35,671 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-14 15:46:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:46:35,673 INFO L225 Difference]: With dead ends: 126 [2018-09-14 15:46:35,673 INFO L226 Difference]: Without dead ends: 80 [2018-09-14 15:46:35,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 191 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=579, Invalid=4823, Unknown=0, NotChecked=0, Total=5402 [2018-09-14 15:46:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-14 15:46:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-09-14 15:46:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-14 15:46:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-14 15:46:35,695 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2018-09-14 15:46:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:46:35,697 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-14 15:46:35,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-14 15:46:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-14 15:46:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-14 15:46:35,698 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:46:35,698 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:46:35,698 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:46:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 964425273, now seen corresponding path program 3 times [2018-09-14 15:46:35,699 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:46:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:35,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:46:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:46:35,700 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:46:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:46:36,842 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-09-14 15:46:37,364 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-14 15:46:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-14 15:46:37,873 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:37,873 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:46:37,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:37,881 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:37,966 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-14 15:46:37,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:37,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:38,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-14 15:46:38,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-09-14 15:46:38,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-14 15:46:38,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-09-14 15:46:38,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-14 15:46:38,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-09-14 15:46:38,852 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:38,853 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:38,854 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:38,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-09-14 15:46:38,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:38,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:38,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-09-14 15:46:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 11 proven. 103 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-14 15:46:39,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:46:43,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-09-14 15:46:43,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:43,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-09-14 15:46:43,977 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:43,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:43,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:43,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 91 [2018-09-14 15:46:44,039 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,039 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,040 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,040 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,048 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:44,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 78 [2018-09-14 15:46:44,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:44,056 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,056 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,057 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,064 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,067 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,079 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:44,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 166 [2018-09-14 15:46:44,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 12 xjuncts. [2018-09-14 15:46:44,115 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:44,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:44,119 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,119 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,120 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,120 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,122 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,123 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 88 [2018-09-14 15:46:44,141 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:44,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-09-14 15:46:44,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-14 15:46:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-14 15:46:44,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,929 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,929 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,931 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:44,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,933 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:44,934 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:44,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 130 [2018-09-14 15:46:44,959 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:45,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-09-14 15:46:45,230 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-09-14 15:46:45,236 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,236 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,236 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-09-14 15:46:45,291 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:46:45,291 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:45,294 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,294 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,295 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,295 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 71 [2018-09-14 15:46:45,310 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-09-14 15:46:45,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,316 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 127 [2018-09-14 15:46:45,375 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 14 xjuncts. [2018-09-14 15:46:45,398 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,411 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,420 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,434 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,456 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:45,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2018-09-14 15:46:45,474 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:45,648 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-09-14 15:46:45,774 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-14 15:46:45,892 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-14 15:46:46,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-09-14 15:46:46,326 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:46,328 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,328 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-09-14 15:46:46,336 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:46,338 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-09-14 15:46:46,339 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:46,342 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-09-14 15:46:46,343 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:46,345 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:46:46,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-09-14 15:46:46,346 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:46,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-09-14 15:46:46,349 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:46,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-09-14 15:46:46,636 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 6 variables, input treesize:213, output treesize:328 [2018-09-14 15:46:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 11 proven. 65 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 15:46:47,100 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:46:47,100 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:46:47,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:46:47,116 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:46:47,736 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-14 15:46:47,736 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:46:47,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:46:47,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-14 15:46:47,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:7 [2018-09-14 15:46:47,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-14 15:46:47,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-09-14 15:46:47,845 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:46:47,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-09-14 15:46:47,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:47,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:19 [2018-09-14 15:46:48,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-14 15:46:48,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2018-09-14 15:46:48,244 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-14 15:46:48,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:48,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-09-14 15:46:48,557 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,583 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,606 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,609 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-09-14 15:46:48,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-09-14 15:46:48,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:48,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:58 [2018-09-14 15:46:48,867 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,868 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,869 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,870 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,874 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,875 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:46:48,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 59 [2018-09-14 15:46:48,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:46:48,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-14 15:46:48,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:67 [2018-09-14 15:46:49,761 WARN L178 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-14 15:46:50,760 WARN L178 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-09-14 15:46:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-14 15:46:51,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:00,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 81 [2018-09-14 15:47:00,810 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:00,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-09-14 15:47:00,816 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:00,817 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:00,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-09-14 15:47:00,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:00,864 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:00,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 76 [2018-09-14 15:47:00,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:00,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2018-09-14 15:47:00,897 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:00,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-09-14 15:47:01,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:47:01,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:47:01,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 81 [2018-09-14 15:47:01,296 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:01,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-09-14 15:47:01,302 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:01,302 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:01,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-09-14 15:47:01,344 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:01,350 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:01,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 76 [2018-09-14 15:47:01,367 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-09-14 15:47:01,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2018-09-14 15:47:01,387 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:01,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-09-14 15:47:01,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:47:01,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-14 15:47:01,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-14 15:47:01,922 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:157, output treesize:303 [2018-09-14 15:47:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-09-14 15:47:02,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:47:02,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 25, 29, 23] total 100 [2018-09-14 15:47:02,113 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:47:02,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-14 15:47:02,114 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-14 15:47:02,118 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1340, Invalid=8557, Unknown=3, NotChecked=0, Total=9900 [2018-09-14 15:47:02,118 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 54 states. [2018-09-14 15:47:05,959 WARN L178 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2018-09-14 15:47:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:47:06,527 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-09-14 15:47:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-14 15:47:06,528 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 74 [2018-09-14 15:47:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:47:06,529 INFO L225 Difference]: With dead ends: 90 [2018-09-14 15:47:06,530 INFO L226 Difference]: Without dead ends: 88 [2018-09-14 15:47:06,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 211 SyntacticMatches, 16 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5451 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=1890, Invalid=11679, Unknown=3, NotChecked=0, Total=13572 [2018-09-14 15:47:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-14 15:47:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-09-14 15:47:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-14 15:47:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-09-14 15:47:06,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 74 [2018-09-14 15:47:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:47:06,548 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-09-14 15:47:06,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-14 15:47:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-09-14 15:47:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-14 15:47:06,550 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:47:06,550 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:47:06,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:47:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2076817691, now seen corresponding path program 4 times [2018-09-14 15:47:06,551 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:47:06,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:47:06,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:47:06,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:47:06,552 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:47:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:47:07,120 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-09-14 15:47:07,662 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-09-14 15:47:07,909 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-09-14 15:47:08,153 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-09-14 15:47:08,397 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-09-14 15:47:08,611 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-09-14 15:47:08,820 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2018-09-14 15:47:09,060 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-09-14 15:47:09,204 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2018-09-14 15:47:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 132 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:47:09,958 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:09,959 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 15:47:09,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:47:09,969 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:47:09,998 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:47:09,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:47:10,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:10,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-09-14 15:47:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-09-14 15:47:10,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:10,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:70 [2018-09-14 15:47:10,214 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2018-09-14 15:47:10,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,249 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-09-14 15:47:10,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:10,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:96 [2018-09-14 15:47:10,481 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,482 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,483 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 78 [2018-09-14 15:47:10,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,531 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,533 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,534 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-09-14 15:47:10,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:10,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:118 [2018-09-14 15:47:10,792 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,793 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,795 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,796 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,797 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,798 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 112 [2018-09-14 15:47:10,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,864 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,866 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,867 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,868 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,869 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,870 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:10,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 111 [2018-09-14 15:47:10,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:10,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:10,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:142, output treesize:140 [2018-09-14 15:47:11,179 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:47:11,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:11,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-09-14 15:47:11,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:11,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:47:11,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:71 [2018-09-14 15:47:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 130 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 15:47:21,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:47:31,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,452 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,453 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,454 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,454 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:31,455 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,455 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,455 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,456 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,456 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,457 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:31,458 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,459 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 165 [2018-09-14 15:47:31,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-14 15:47:31,572 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,573 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,574 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,574 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,575 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,576 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,576 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,577 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,577 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,579 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:31,579 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,580 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,581 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:31,582 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 163 [2018-09-14 15:47:31,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-14 15:47:31,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-09-14 15:47:31,689 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-09-14 15:47:31,694 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,694 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,694 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-09-14 15:47:31,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,704 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,704 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,704 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-09-14 15:47:31,803 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,805 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,813 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 174 [2018-09-14 15:47:31,881 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-14 15:47:31,910 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 128 xjuncts. [2018-09-14 15:47:31,914 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,915 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,916 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,917 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,919 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,920 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:31,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 92 [2018-09-14 15:47:31,937 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:33,289 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 19 xjuncts. [2018-09-14 15:47:33,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-14 15:47:33,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-14 15:47:34,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-14 15:47:34,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 81 [2018-09-14 15:47:34,703 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-09-14 15:47:34,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-09-14 15:47:34,725 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,725 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,727 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 98 [2018-09-14 15:47:34,805 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,818 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,823 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 164 [2018-09-14 15:47:34,890 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-14 15:47:34,916 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 128 xjuncts. [2018-09-14 15:47:34,942 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,954 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,954 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,960 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,961 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,962 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,963 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:47:34,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 84 [2018-09-14 15:47:34,979 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:36,066 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-09-14 15:47:36,423 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-14 15:47:36,699 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-14 15:47:36,980 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-14 15:47:37,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-09-14 15:47:37,767 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:245, output treesize:1876 [2018-09-14 15:47:38,245 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2018-09-14 15:47:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-14 15:47:38,295 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:47:38,295 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:47:38,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:47:38,310 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:47:38,458 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:47:38,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:47:38,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:47:38,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-09-14 15:47:38,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:38,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-09-14 15:47:38,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:38,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:38,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:52 [2018-09-14 15:47:38,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-09-14 15:47:38,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:38,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-09-14 15:47:38,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:38,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-14 15:47:38,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:67 [2018-09-14 15:47:39,469 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:39,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-09-14 15:47:39,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:39,522 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:39,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-09-14 15:47:39,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:39,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-14 15:47:39,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:101 [2018-09-14 15:47:40,042 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,043 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,044 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2018-09-14 15:47:40,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:40,107 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,108 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,109 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 86 [2018-09-14 15:47:40,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:40,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-09-14 15:47:40,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:131, output treesize:129 [2018-09-14 15:47:40,695 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,696 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,697 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,698 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,700 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,701 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 100 [2018-09-14 15:47:40,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:40,801 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,802 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,803 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,805 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,806 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,808 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:40,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 116 [2018-09-14 15:47:40,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:40,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-09-14 15:47:40,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:159, output treesize:157 [2018-09-14 15:47:41,554 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,556 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,557 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,558 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,559 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,561 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,563 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,565 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,566 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,568 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:47:41,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 148 [2018-09-14 15:47:41,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:47:41,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-14 15:47:41,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:183, output treesize:92 [2018-09-14 15:47:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 120 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-14 15:47:45,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:02,877 WARN L178 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-09-14 15:48:02,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 84 [2018-09-14 15:48:02,886 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2018-09-14 15:48:02,892 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,892 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-09-14 15:48:02,900 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,900 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,901 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-09-14 15:48:02,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2018-09-14 15:48:02,962 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:02,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:02,981 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 92 [2018-09-14 15:48:03,008 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-09-14 15:48:03,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-14 15:48:03,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-14 15:48:03,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-14 15:48:03,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-14 15:48:03,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 84 [2018-09-14 15:48:03,658 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2018-09-14 15:48:03,664 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,665 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-09-14 15:48:03,673 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,673 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,674 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-09-14 15:48:03,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2018-09-14 15:48:03,737 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-09-14 15:48:03,741 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,751 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:48:03,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 92 [2018-09-14 15:48:03,786 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-09-14 15:48:03,941 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-14 15:48:04,044 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-14 15:48:04,125 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-14 15:48:04,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-14 15:48:04,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-09-14 15:48:04,620 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:163, output treesize:303 [2018-09-14 15:48:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 82 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:48:04,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:48:04,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 27, 29, 25] total 106 [2018-09-14 15:48:04,812 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:48:04,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-14 15:48:04,814 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-14 15:48:04,818 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=10101, Unknown=12, NotChecked=0, Total=11130 [2018-09-14 15:48:04,818 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 53 states. [2018-09-14 15:48:05,898 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 19 [2018-09-14 15:48:06,246 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 19 [2018-09-14 15:48:07,250 WARN L178 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2018-09-14 15:48:11,265 WARN L178 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2018-09-14 15:48:12,020 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-09-14 15:48:14,612 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 48 [2018-09-14 15:48:14,943 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2018-09-14 15:48:15,582 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2018-09-14 15:48:16,098 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 58 [2018-09-14 15:48:17,001 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 57 [2018-09-14 15:48:17,578 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 55 [2018-09-14 15:48:17,949 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 48 [2018-09-14 15:48:18,521 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 55 [2018-09-14 15:48:19,106 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 55 [2018-09-14 15:48:19,635 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 48 [2018-09-14 15:48:20,441 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 86 [2018-09-14 15:48:21,271 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 89 [2018-09-14 15:48:22,031 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2018-09-14 15:48:22,399 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-09-14 15:48:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:48:22,403 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-09-14 15:48:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-14 15:48:22,404 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 83 [2018-09-14 15:48:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:48:22,406 INFO L225 Difference]: With dead ends: 112 [2018-09-14 15:48:22,406 INFO L226 Difference]: Without dead ends: 110 [2018-09-14 15:48:22,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 248 SyntacticMatches, 13 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6135 ImplicationChecksByTransitivity, 62.8s TimeCoverageRelationStatistics Valid=1948, Invalid=16671, Unknown=13, NotChecked=0, Total=18632 [2018-09-14 15:48:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-14 15:48:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2018-09-14 15:48:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-14 15:48:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-14 15:48:22,431 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 83 [2018-09-14 15:48:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:48:22,432 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-14 15:48:22,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-14 15:48:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-14 15:48:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-14 15:48:22,434 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:48:22,434 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:48:22,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:48:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1083312199, now seen corresponding path program 5 times [2018-09-14 15:48:22,435 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:48:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:48:22,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:48:22,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:48:22,436 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:48:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:48:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 70 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-14 15:48:22,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:48:22,729 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:48:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:48:22,738 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:48:42,494 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-14 15:48:42,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:48:42,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:48:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-14 15:48:42,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-14 15:48:42,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:48:42,795 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:48:42,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:48:42,810 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:48:43,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-14 15:48:43,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:48:43,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:48:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-14 15:48:43,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:48:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-14 15:48:43,206 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:48:43,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 9] total 23 [2018-09-14 15:48:43,207 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:48:43,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-14 15:48:43,207 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-14 15:48:43,207 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-09-14 15:48:43,208 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 16 states. [2018-09-14 15:48:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:48:43,511 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-09-14 15:48:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 15:48:43,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2018-09-14 15:48:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:48:43,512 INFO L225 Difference]: With dead ends: 164 [2018-09-14 15:48:43,512 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 15:48:43,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-09-14 15:48:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 15:48:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 15:48:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 15:48:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 15:48:43,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-09-14 15:48:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:48:43,514 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 15:48:43,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-14 15:48:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 15:48:43,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 15:48:43,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 15:48:43,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 15:48:43,911 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 250 [2018-09-14 15:48:45,325 WARN L178 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 263 DAG size of output: 35 [2018-09-14 15:48:46,079 WARN L178 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 90 [2018-09-14 15:48:46,958 WARN L178 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 88 [2018-09-14 15:48:51,610 WARN L178 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 250 DAG size of output: 98 [2018-09-14 15:48:51,614 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-14 15:48:51,614 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:48:51,614 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:48:51,614 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-14 15:48:51,614 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 15:48:51,614 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:48:51,615 INFO L422 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (let ((.cse25 (+ main_~max~0 4294967295))) (let ((.cse9 (div .cse25 4294967296))) (let ((.cse5 (mod .cse25 4294967296)) (.cse8 (+ main_~i~0 (* 4294967296 .cse9))) (.cse6 (= main_~max~0 5))) (or (and (exists ((main_~max~0 Int)) (let ((.cse4 (+ main_~max~0 4294967295))) (let ((.cse3 (div .cse4 4294967296))) (let ((.cse1 (* 4294967296 .cse3)) (.cse2 (mod .cse4 4294967296)) (.cse0 (* (- 4294967296) .cse3))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse0 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse0 4294967292))) (< (+ main_~max~0 4294967290) .cse1) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967291)) (select main_~str2~0 4)) (= .cse2 (+ main_~j~0 1)) (<= .cse1 (+ main_~max~0 4294967291)) (<= .cse2 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse0 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967294)) (select main_~str2~0 1))))))) (= .cse5 (+ main_~i~0 3)) .cse6) (let ((.cse7 (* (- 4294967296) .cse9))) (and (= main_~j~0 1) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse7 4294967292))) (= (select main_~str1~0 (+ main_~max~0 .cse7 4294967291)) (select main_~str2~0 4)) (= .cse8 (+ main_~max~0 4294967294)) .cse6 (= (select main_~str1~0 3) (select main_~str2~0 1)) (= (select main_~str2~0 2) (select main_~str1~0 (+ .cse5 (- 2)))) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse7 4294967295))))) (and (exists ((main_~max~0 Int)) (let ((.cse14 (+ main_~max~0 4294967295))) (let ((.cse13 (div .cse14 4294967296))) (let ((.cse11 (* 4294967296 .cse13)) (.cse12 (mod .cse14 4294967296)) (.cse10 (* (- 4294967296) .cse13))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse10 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse10 4294967292))) (< (+ main_~max~0 4294967290) .cse11) (= (select main_~str1~0 (+ main_~max~0 .cse10 4294967291)) (select main_~str2~0 4)) (<= .cse11 (+ main_~max~0 4294967291)) (<= .cse12 2147483647) (= main_~j~0 .cse12) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse10 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse10 4294967294)) (select main_~str2~0 1))))))) .cse6 (= main_~i~0 0)) (and .cse6 (= main_~i~0 4) (exists ((main_~max~0 Int)) (let ((.cse19 (+ main_~max~0 4294967295))) (let ((.cse18 (div .cse19 4294967296))) (let ((.cse17 (* 4294967296 .cse18)) (.cse16 (mod .cse19 4294967296)) (.cse15 (* (- 4294967296) .cse18))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse15 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse15 4294967292))) (= .cse16 (+ main_~j~0 4)) (< (+ main_~max~0 4294967290) .cse17) (= (select main_~str1~0 (+ main_~max~0 .cse15 4294967291)) (select main_~str2~0 4)) (<= .cse17 (+ main_~max~0 4294967291)) (<= .cse16 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse15 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse15 4294967294)) (select main_~str2~0 1)))))))) (and (= .cse8 (+ main_~max~0 4294967293)) .cse6 (exists ((main_~max~0 Int)) (let ((.cse24 (+ main_~max~0 4294967295))) (let ((.cse23 (div .cse24 4294967296))) (let ((.cse21 (* 4294967296 .cse23)) (.cse22 (mod .cse24 4294967296)) (.cse20 (* (- 4294967296) .cse23))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse20 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse20 4294967292))) (< (+ main_~max~0 4294967290) .cse21) (= (select main_~str1~0 (+ main_~max~0 .cse20 4294967291)) (select main_~str2~0 4)) (<= .cse21 (+ main_~max~0 4294967291)) (<= .cse22 2147483647) (= (+ main_~j~0 2) .cse22) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse20 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse20 4294967294)) (select main_~str2~0 1)))))))))))) [2018-09-14 15:48:51,615 INFO L426 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2018-09-14 15:48:51,615 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 11 34) no Hoare annotation was computed. [2018-09-14 15:48:51,615 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 11 34) the Hoare annotation is: true [2018-09-14 15:48:51,615 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 30 33) no Hoare annotation was computed. [2018-09-14 15:48:51,615 INFO L426 ceAbstractionStarter]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L422 ceAbstractionStarter]: At program point L30-4(lines 30 33) the Hoare annotation is: (let ((.cse32 (+ main_~max~0 4294967295))) (let ((.cse31 (div .cse32 4294967296))) (let ((.cse5 (mod .cse32 4294967296)) (.cse30 (* (- 4294967296) .cse31)) (.cse29 (* 4294967296 .cse31))) (let ((.cse19 (+ main_~i~0 .cse29)) (.cse23 (+ main_~max~0 4294967293)) (.cse20 (select main_~str2~0 1)) (.cse17 (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse30 4294967292)))) (.cse18 (= (select main_~str1~0 (+ main_~max~0 .cse30 4294967291)) (select main_~str2~0 4))) (.cse6 (= main_~max~0 5)) (.cse21 (= (select main_~str2~0 2) (select main_~str1~0 (+ .cse5 (- 2))))) (.cse22 (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse30 4294967295))))) (or (and (exists ((main_~max~0 Int)) (let ((.cse4 (+ main_~max~0 4294967295))) (let ((.cse3 (div .cse4 4294967296))) (let ((.cse1 (* 4294967296 .cse3)) (.cse2 (mod .cse4 4294967296)) (.cse0 (* (- 4294967296) .cse3))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse0 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse0 4294967292))) (< (+ main_~max~0 4294967290) .cse1) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967291)) (select main_~str2~0 4)) (= .cse2 (+ main_~j~0 1)) (<= .cse1 (+ main_~max~0 4294967291)) (<= .cse2 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse0 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967294)) (select main_~str2~0 1))))))) (= .cse5 (+ main_~i~0 3)) .cse6) (and (exists ((main_~max~0 Int)) (let ((.cse11 (+ main_~max~0 4294967295))) (let ((.cse10 (div .cse11 4294967296))) (let ((.cse8 (* 4294967296 .cse10)) (.cse9 (mod .cse11 4294967296)) (.cse7 (* (- 4294967296) .cse10))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse7 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse7 4294967292))) (< (+ main_~max~0 4294967290) .cse8) (= (select main_~str1~0 (+ main_~max~0 .cse7 4294967291)) (select main_~str2~0 4)) (<= .cse8 (+ main_~max~0 4294967291)) (<= .cse9 2147483647) (= main_~j~0 .cse9) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse7 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse7 4294967294)) (select main_~str2~0 1))))))) .cse6 (= main_~i~0 0)) (and .cse6 (= main_~i~0 4) (exists ((main_~max~0 Int)) (let ((.cse16 (+ main_~max~0 4294967295))) (let ((.cse15 (div .cse16 4294967296))) (let ((.cse14 (* 4294967296 .cse15)) (.cse13 (mod .cse16 4294967296)) (.cse12 (* (- 4294967296) .cse15))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse12 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse12 4294967292))) (= .cse13 (+ main_~j~0 4)) (< (+ main_~max~0 4294967290) .cse14) (= (select main_~str1~0 (+ main_~max~0 .cse12 4294967291)) (select main_~str2~0 4)) (<= .cse14 (+ main_~max~0 4294967291)) (<= .cse13 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse12 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse12 4294967294)) (select main_~str2~0 1)))))))) (and (= main_~j~0 1) .cse17 .cse18 (= .cse19 (+ main_~max~0 4294967294)) .cse6 (= (select main_~str1~0 3) .cse20) .cse21 .cse22) (and (= .cse19 .cse23) .cse6 (exists ((main_~max~0 Int)) (let ((.cse28 (+ main_~max~0 4294967295))) (let ((.cse27 (div .cse28 4294967296))) (let ((.cse25 (* 4294967296 .cse27)) (.cse26 (mod .cse28 4294967296)) (.cse24 (* (- 4294967296) .cse27))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse24 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse24 4294967292))) (< (+ main_~max~0 4294967290) .cse25) (= (select main_~str1~0 (+ main_~max~0 .cse24 4294967291)) (select main_~str2~0 4)) (<= .cse25 (+ main_~max~0 4294967291)) (<= .cse26 2147483647) (= (+ main_~j~0 2) .cse26) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse24 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse24 4294967294)) (select main_~str2~0 1)))))))) (and (and (not (= .cse23 (+ main_~i~0 main_~j~0 .cse29))) (= .cse20 (select main_~str1~0 (+ .cse5 (- 1)))) .cse17 .cse18 .cse6 .cse21 .cse22) (= main_~i~0 5))))))) [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L30-5(lines 11 34) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 24 27) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L24-3(lines 24 27) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L422 ceAbstractionStarter]: At program point L24-4(lines 24 27) the Hoare annotation is: (let ((.cse8 (+ main_~max~0 4294967295))) (let ((.cse9 (* 4294967296 (div .cse8 4294967296)))) (let ((.cse6 (select main_~str1~0 (+ main_~i~0 3))) (.cse0 (select main_~str1~0 (+ main_~i~0 2))) (.cse5 (select main_~str2~0 1)) (.cse4 (select main_~str1~0 (+ main_~i~0 1))) (.cse7 (select main_~str2~0 2)) (.cse3 (= main_~max~0 5)) (.cse2 (+ main_~i~0 .cse9)) (.cse1 (select main_~str2~0 0)) (.cse10 (mod .cse8 4294967296))) (or (and (and (= main_~j~0 2) (= .cse0 .cse1) (= .cse2 (+ main_~max~0 4294967293))) .cse3 (= .cse4 .cse5)) (and (= main_~j~0 4) (and (= .cse1 (select main_~str1~0 (+ main_~i~0 4))) (= (select main_~str2~0 (+ main_~j~0 (- 3))) .cse6) (= .cse4 (select main_~str2~0 (+ main_~j~0 (- 1))))) .cse3 (= .cse0 .cse7) (= main_~i~0 0)) (and .cse3 (and (= main_~j~0 3) (= .cse1 .cse6)) (= main_~i~0 1) (= .cse4 .cse7) (= .cse5 .cse0)) (and .cse3 (= main_~j~0 0) (= main_~i~0 4)) (let ((.cse11 (+ main_~i~0 5))) (and (<= .cse8 (+ main_~i~0 main_~j~0 .cse9)) (= .cse5 (select main_~str1~0 (+ .cse10 (- 1)))) (= .cse11 .cse10) (= .cse4 (select main_~str2~0 4)) (= (select main_~str2~0 3) (select main_~str1~0 (+ .cse10 (- 3)))) .cse3 (= .cse1 (select main_~str1~0 .cse11)) (= .cse7 (select main_~str1~0 (+ .cse10 (- 2)))))) (and .cse3 (= .cse2 (+ main_~max~0 4294967294)) (= .cse1 (select main_~str1~0 .cse10)) (= main_~j~0 1)))))) [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L24-5(lines 24 27) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L16-1(lines 16 18) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L16-3(lines 16 18) no Hoare annotation was computed. [2018-09-14 15:48:51,616 INFO L422 ceAbstractionStarter]: At program point L16-4(lines 16 18) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (.cse2 (<= 5 main_~max~0))) (let ((.cse0 (and (<= main_~max~0 5) (<= 4294967298 .cse1) .cse2))) (or (and .cse0 (< main_~i~0 4)) (and .cse0 (= main_~i~0 4)) (and .cse0 (= main_~i~0 5)) (and (= main_~max~0 5) (<= 4294967297 .cse1) (<= main_~i~0 1)) (and (<= main_~max~0 (+ (* 2 main_~i~0) 5)) .cse2 (= main_~i~0 0))))) [2018-09-14 15:48:51,616 INFO L426 ceAbstractionStarter]: For program point L16-5(lines 16 18) no Hoare annotation was computed. [2018-09-14 15:48:51,617 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-14 15:48:51,617 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-14 15:48:51,617 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:48:51,617 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-14 15:48:51,617 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-14 15:48:51,617 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:48:51,637 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,638 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,638 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,638 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,639 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,639 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,639 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,639 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,640 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,640 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,640 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,640 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,641 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,641 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,641 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,641 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,642 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,642 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,642 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,643 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,643 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,643 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,643 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,644 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,644 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,644 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,644 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,645 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,645 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,645 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,645 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,645 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,646 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,646 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,646 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,646 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,647 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,647 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,647 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,647 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,648 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,648 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,648 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,648 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,648 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,649 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,649 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,649 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,650 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,650 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,650 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,650 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,650 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,651 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,651 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,651 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,651 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,652 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,652 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,652 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,652 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,652 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,653 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,653 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,659 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,659 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,659 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,660 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,660 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,660 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,660 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,661 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,661 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,661 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,661 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,662 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,662 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,662 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,662 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,662 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,663 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,663 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,663 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,664 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,664 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,664 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,664 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,664 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,665 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,665 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,665 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,665 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,666 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,666 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,666 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,666 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,667 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,667 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,667 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,667 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,668 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,668 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,668 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,668 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,668 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,669 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,669 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,669 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,669 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,670 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,670 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,670 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,670 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,671 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,671 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,671 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,671 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,672 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,672 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,672 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,672 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,672 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,673 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,673 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,673 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,673 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,673 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,674 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 03:48:51 BoogieIcfgContainer [2018-09-14 15:48:51,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 15:48:51,679 INFO L168 Benchmark]: Toolchain (without parser) took 178237.30 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.2 MB). Peak memory consumption was 976.7 MB. Max. memory is 7.1 GB. [2018-09-14 15:48:51,679 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 15:48:51,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-14 15:48:51,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 15:48:51,680 INFO L168 Benchmark]: Boogie Preprocessor took 36.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 15:48:51,680 INFO L168 Benchmark]: RCFGBuilder took 595.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-09-14 15:48:51,681 INFO L168 Benchmark]: TraceAbstraction took 177245.30 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 348.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -40.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-14 15:48:51,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 324.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 595.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 177245.30 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 348.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -40.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((((max <= 5 && 4294967298 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 5 <= max) && i < 4) || (((max <= 5 && 4294967298 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 5 <= max) && i == 4)) || (((max <= 5 && 4294967298 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 5 <= max) && i == 5)) || ((max == 5 && 4294967297 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((max <= 2 * i + 5 && 5 <= max) && i == 0) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((((j == 2 && str1[i + 2] == str2[0]) && i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967293) && max == 5) && str1[i + 1] == str2[1]) || ((((j == 4 && (str2[0] == str1[i + 4] && str2[j + -3] == str1[i + 3]) && str1[i + 1] == str2[j + -1]) && max == 5) && str1[i + 2] == str2[2]) && i == 0)) || ((((max == 5 && j == 3 && str2[0] == str1[i + 3]) && i == 1) && str1[i + 1] == str2[2]) && str2[1] == str1[i + 2])) || ((max == 5 && j == 0) && i == 4)) || (((((((max + 4294967295 <= i + j + 4294967296 * ((max + 4294967295) / 4294967296) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && i + 5 == (max + 4294967295) % 4294967296) && str1[i + 1] == str2[4]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3]) && max == 5) && str2[0] == str1[i + 5]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2])) || (((max == 5 && i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967294) && str2[0] == str1[(max + 4294967295) % 4294967296]) && j == 1) - InvariantResult [Line: 30]: Loop Invariant [2018-09-14 15:48:51,696 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,697 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,697 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,697 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,697 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,697 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,698 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,698 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,698 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,698 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,698 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,699 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,699 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,699 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,699 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,699 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,700 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,700 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,700 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,700 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,701 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,701 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,701 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,701 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,702 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,702 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,702 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,702 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,702 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,702 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,703 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,703 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,703 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,703 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,704 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,704 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,704 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,704 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,704 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,704 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,705 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,705 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,705 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,705 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,705 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,706 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,706 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,706 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,706 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,706 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,706 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,707 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,707 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,707 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,707 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,707 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,708 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,708 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,708 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,708 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,708 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,708 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,709 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,709 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,713 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,713 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,714 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,714 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,714 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,714 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,715 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,715 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,715 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,715 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,715 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,716 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,716 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,716 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,716 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,716 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,717 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,717 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,717 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,717 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,717 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,718 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,718 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,718 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,718 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,718 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,719 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,719 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,719 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,719 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,719 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,719 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,720 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,720 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,720 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,720 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,721 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,721 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,721 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,721 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,721 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,722 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,722 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,722 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,722 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,722 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,723 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,723 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,723 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,723 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,723 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,723 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,724 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,724 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,724 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,724 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,724 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-14 15:48:51,725 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] Derived loop invariant: (((((((\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && (main_~max~0 + 4294967295) % 4294967296 == j + 1) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]) && (max + 4294967295) % 4294967296 == i + 3) && max == 5) || (((\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && j == (main_~max~0 + 4294967295) % 4294967296) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]) && max == 5) && i == 0)) || ((max == 5 && i == 4) && (\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && (main_~max~0 + 4294967295) % 4294967296 == j + 4) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]))) || (((((((j == 1 && str2[3] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967292]) && str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967291] == str2[4]) && i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967294) && max == 5) && str1[3] == str2[1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[0] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967295])) || ((i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967293 && max == 5) && (\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && j + 2 == (main_~max~0 + 4294967295) % 4294967296) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]))) || (((((((!(max + 4294967293 == i + j + 4294967296 * ((max + 4294967295) / 4294967296)) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[3] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967292]) && str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967291] == str2[4]) && max == 5) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[0] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967295]) && i == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 177.1s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 34.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 730 SDslu, 4665 SDs, 0 SdLazy, 7219 SolverSat, 704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2442 GetRequests, 1746 SyntacticMatches, 67 SemanticMatches, 629 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15529 ImplicationChecksByTransitivity, 113.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 149 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 33 PreInvPairs, 64 NumberOfFragments, 1677 HoareAnnotationTreeSize, 33 FomulaSimplifications, 326549 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 283841 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 21.9s SatisfiabilityAnalysisTime, 111.5s InterpolantComputationTime, 1714 NumberOfCodeBlocks, 1702 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 2753 ConstructedInterpolants, 197 QuantifiedInterpolants, 3103944 SizeOfPredicates, 111 NumberOfNonLiveVariables, 2315 ConjunctsInSsa, 648 ConjunctsInUnsatCore, 58 InterpolantComputations, 5 PerfectInterpolantSequences, 1952/4014 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_15-48-51-733.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_15-48-51-733.csv Received shutdown request...