java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 23:29:02,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 23:29:02,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 23:29:02,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 23:29:02,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 23:29:02,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 23:29:02,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 23:29:02,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 23:29:02,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 23:29:02,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 23:29:02,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 23:29:02,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 23:29:02,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 23:29:02,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 23:29:02,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 23:29:02,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 23:29:02,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 23:29:02,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 23:29:02,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 23:29:02,838 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 23:29:02,839 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 23:29:02,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 23:29:02,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 23:29:02,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 23:29:02,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 23:29:02,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 23:29:02,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 23:29:02,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 23:29:02,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 23:29:02,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 23:29:02,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 23:29:02,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 23:29:02,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 23:29:02,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 23:29:02,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 23:29:02,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 23:29:02,852 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-23 23:29:02,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 23:29:02,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 23:29:02,869 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 23:29:02,869 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-23 23:29:02,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-23 23:29:02,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-23 23:29:02,870 INFO L133 SettingsManager]: * Use SBE=true [2018-07-23 23:29:02,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 23:29:02,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 23:29:02,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 23:29:02,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 23:29:02,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 23:29:02,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 23:29:02,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 23:29:02,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 23:29:02,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 23:29:02,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 23:29:02,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 23:29:02,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 23:29:02,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 23:29:02,873 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 23:29:02,873 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 23:29:02,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 23:29:02,873 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-23 23:29:02,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 23:29:02,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 23:29:02,874 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 23:29:02,874 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 23:29:02,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 23:29:02,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 23:29:02,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 23:29:02,947 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 23:29:02,948 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 23:29:02,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-07-23 23:29:03,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cd9a42f/2a6e512038624199ab1bd6215c9373e6/FLAG018e4d19e [2018-07-23 23:29:03,465 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 23:29:03,466 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-07-23 23:29:03,474 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cd9a42f/2a6e512038624199ab1bd6215c9373e6/FLAG018e4d19e [2018-07-23 23:29:03,494 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cd9a42f/2a6e512038624199ab1bd6215c9373e6 [2018-07-23 23:29:03,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 23:29:03,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 23:29:03,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 23:29:03,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 23:29:03,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 23:29:03,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c2495d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03, skipping insertion in model container [2018-07-23 23:29:03,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,713 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 23:29:03,764 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 23:29:03,781 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 23:29:03,793 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 23:29:03,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03 WrapperNode [2018-07-23 23:29:03,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 23:29:03,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 23:29:03,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 23:29:03,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 23:29:03,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 23:29:03,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 23:29:03,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 23:29:03,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 23:29:03,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (1/1) ... [2018-07-23 23:29:03,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 23:29:03,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 23:29:03,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 23:29:03,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 23:29:03,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (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-07-23 23:29:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 23:29:04,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 23:29:04,415 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 23:29:04,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:29:04 BoogieIcfgContainer [2018-07-23 23:29:04,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 23:29:04,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 23:29:04,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 23:29:04,428 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 23:29:04,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 11:29:03" (1/3) ... [2018-07-23 23:29:04,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770b9c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:29:04, skipping insertion in model container [2018-07-23 23:29:04,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:03" (2/3) ... [2018-07-23 23:29:04,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770b9c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:29:04, skipping insertion in model container [2018-07-23 23:29:04,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:29:04" (3/3) ... [2018-07-23 23:29:04,435 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-07-23 23:29:04,448 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 23:29:04,461 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 23:29:04,524 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 23:29:04,525 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 23:29:04,525 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 23:29:04,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 23:29:04,526 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 23:29:04,526 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 23:29:04,526 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 23:29:04,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 23:29:04,526 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 23:29:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-07-23 23:29:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 23:29:04,550 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:04,551 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:04,551 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1034594124, now seen corresponding path program 1 times [2018-07-23 23:29:04,559 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:04,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:04,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:04,690 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 23:29:04,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 23:29:04,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-23 23:29:04,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-23 23:29:04,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-23 23:29:04,715 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-07-23 23:29:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:04,735 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-07-23 23:29:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-23 23:29:04,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-07-23 23:29:04,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:04,749 INFO L225 Difference]: With dead ends: 42 [2018-07-23 23:29:04,749 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 23:29:04,755 INFO L573 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-07-23 23:29:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 23:29:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 23:29:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 23:29:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-07-23 23:29:04,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 8 [2018-07-23 23:29:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:04,796 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-07-23 23:29:04,796 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-23 23:29:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-07-23 23:29:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 23:29:04,797 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:04,797 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:04,798 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:04,798 INFO L82 PathProgramCache]: Analyzing trace with hash 318248807, now seen corresponding path program 1 times [2018-07-23 23:29:04,798 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:04,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:04,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:04,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:04,969 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 23:29:04,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 23:29:04,971 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 23:29:04,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 23:29:04,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 23:29:04,972 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2018-07-23 23:29:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:05,179 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-07-23 23:29:05,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 23:29:05,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-07-23 23:29:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:05,181 INFO L225 Difference]: With dead ends: 36 [2018-07-23 23:29:05,181 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 23:29:05,182 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 23:29:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 23:29:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-07-23 23:29:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 23:29:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-07-23 23:29:05,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2018-07-23 23:29:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:05,188 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-07-23 23:29:05,188 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 23:29:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-07-23 23:29:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 23:29:05,189 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:05,189 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:05,189 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 255702044, now seen corresponding path program 1 times [2018-07-23 23:29:05,190 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:05,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:05,599 WARN L169 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-07-23 23:29:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:05,770 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:05,770 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:05,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:05,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:06,000 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:06,033 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 14 treesize of output 19 [2018-07-23 23:29:06,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:06,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:29:06,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:06,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:06,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-07-23 23:29:06,174 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:06,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:06,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:06,175 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2018-07-23 23:29:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:07,048 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-07-23 23:29:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 23:29:07,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-23 23:29:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:07,050 INFO L225 Difference]: With dead ends: 75 [2018-07-23 23:29:07,051 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 23:29:07,052 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:29:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 23:29:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2018-07-23 23:29:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 23:29:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-07-23 23:29:07,059 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 15 [2018-07-23 23:29:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:07,060 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-07-23 23:29:07,060 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-07-23 23:29:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 23:29:07,061 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:07,061 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:07,061 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:07,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2096837006, now seen corresponding path program 1 times [2018-07-23 23:29:07,062 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:07,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:07,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:07,454 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:07,454 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:07,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:07,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:07,630 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:07,631 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 16 treesize of output 21 [2018-07-23 23:29:07,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:07,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:07,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-07-23 23:29:07,749 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:07,753 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:07,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-07-23 23:29:07,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:07,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:29:07,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-07-23 23:29:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:07,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:07,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2018-07-23 23:29:07,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 23:29:07,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 23:29:07,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-07-23 23:29:07,857 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 15 states. [2018-07-23 23:29:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:08,842 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-07-23 23:29:08,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 23:29:08,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2018-07-23 23:29:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:08,845 INFO L225 Difference]: With dead ends: 81 [2018-07-23 23:29:08,845 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 23:29:08,846 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:29:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 23:29:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2018-07-23 23:29:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 23:29:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-07-23 23:29:08,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 19 [2018-07-23 23:29:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:08,854 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-07-23 23:29:08,854 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 23:29:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-07-23 23:29:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 23:29:08,855 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:08,855 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:08,856 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1561856486, now seen corresponding path program 1 times [2018-07-23 23:29:08,856 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:08,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:11,106 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:11,106 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:11,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:11,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:11,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:11,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-07-23 23:29:11,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 23:29:11,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 23:29:11,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2018-07-23 23:29:11,369 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2018-07-23 23:29:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:11,519 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-07-23 23:29:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 23:29:11,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-07-23 23:29:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:11,521 INFO L225 Difference]: With dead ends: 51 [2018-07-23 23:29:11,522 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 23:29:11,522 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=39, Invalid=92, Unknown=1, NotChecked=0, Total=132 [2018-07-23 23:29:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 23:29:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-07-23 23:29:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 23:29:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-07-23 23:29:11,528 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-07-23 23:29:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:11,528 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-07-23 23:29:11,528 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 23:29:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-07-23 23:29:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 23:29:11,529 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:11,529 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:11,530 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1230621423, now seen corresponding path program 2 times [2018-07-23 23:29:11,530 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:11,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:11,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:11,815 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:11,815 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:11,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:11,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:11,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:11,867 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:11,870 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 14 treesize of output 19 [2018-07-23 23:29:11,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:11,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:11,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:11,934 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 14 treesize of output 13 [2018-07-23 23:29:11,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:11,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:11,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:29:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:12,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:12,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-07-23 23:29:12,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:12,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:12,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:12,001 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2018-07-23 23:29:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:12,344 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-07-23 23:29:12,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 23:29:12,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 23:29:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:12,348 INFO L225 Difference]: With dead ends: 83 [2018-07-23 23:29:12,348 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 23:29:12,349 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:29:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 23:29:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2018-07-23 23:29:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 23:29:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-07-23 23:29:12,357 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 21 [2018-07-23 23:29:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:12,357 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-07-23 23:29:12,358 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-07-23 23:29:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 23:29:12,359 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:12,359 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:12,359 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1336528103, now seen corresponding path program 2 times [2018-07-23 23:29:12,359 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:12,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:12,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:12,602 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:12,603 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:12,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:12,647 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:12,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:12,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:12,719 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 12 treesize of output 11 [2018-07-23 23:29:12,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:12,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:12,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:12,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:12,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-07-23 23:29:12,771 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:12,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:12,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:12,772 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 12 states. [2018-07-23 23:29:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:13,384 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2018-07-23 23:29:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 23:29:13,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-07-23 23:29:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:13,386 INFO L225 Difference]: With dead ends: 132 [2018-07-23 23:29:13,387 INFO L226 Difference]: Without dead ends: 116 [2018-07-23 23:29:13,388 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:29:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-23 23:29:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 51. [2018-07-23 23:29:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 23:29:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-07-23 23:29:13,398 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 25 [2018-07-23 23:29:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:13,399 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-07-23 23:29:13,399 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-07-23 23:29:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 23:29:13,400 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:13,400 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:13,400 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 545896167, now seen corresponding path program 3 times [2018-07-23 23:29:13,401 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:13,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:13,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:13,904 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:13,904 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:13,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:13,960 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 23:29:13,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:13,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:13,984 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:13,985 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 27 [2018-07-23 23:29:13,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:14,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:14,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-07-23 23:29:14,124 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:14,125 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:14,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-07-23 23:29:14,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:14,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:14,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-07-23 23:29:14,220 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:14,222 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:14,223 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:14,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-07-23 23:29:14,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:14,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:14,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:29:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:14,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:14,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-07-23 23:29:14,326 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 23:29:14,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 23:29:14,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-07-23 23:29:14,327 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 19 states. [2018-07-23 23:29:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:14,919 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-07-23 23:29:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 23:29:14,920 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-07-23 23:29:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:14,921 INFO L225 Difference]: With dead ends: 108 [2018-07-23 23:29:14,922 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 23:29:14,923 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:29:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 23:29:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 57. [2018-07-23 23:29:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 23:29:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-07-23 23:29:14,935 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 25 [2018-07-23 23:29:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:14,936 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-07-23 23:29:14,936 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 23:29:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-07-23 23:29:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 23:29:14,937 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:14,937 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:14,937 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash 621992465, now seen corresponding path program 2 times [2018-07-23 23:29:14,938 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:14,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:14,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:14,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:14,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:15,508 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:15,508 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:15,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:15,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:15,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:15,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:15,679 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 12 treesize of output 11 [2018-07-23 23:29:15,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:15,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:15,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:16,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:16,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-07-23 23:29:16,146 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 23:29:16,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 23:29:16,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:29:16,147 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 20 states. [2018-07-23 23:29:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:16,693 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-07-23 23:29:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 23:29:16,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-07-23 23:29:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:16,696 INFO L225 Difference]: With dead ends: 103 [2018-07-23 23:29:16,696 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 23:29:16,697 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2018-07-23 23:29:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 23:29:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2018-07-23 23:29:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 23:29:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2018-07-23 23:29:16,709 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 26 [2018-07-23 23:29:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:16,709 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2018-07-23 23:29:16,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 23:29:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2018-07-23 23:29:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 23:29:16,711 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:16,711 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:16,711 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash -301635002, now seen corresponding path program 3 times [2018-07-23 23:29:16,711 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:16,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:16,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:17,090 WARN L169 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-07-23 23:29:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:17,272 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:17,272 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:17,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:17,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 23:29:17,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:17,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:17,330 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:17,332 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 14 treesize of output 19 [2018-07-23 23:29:17,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:17,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:17,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:17,402 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:17,403 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:17,410 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 16 treesize of output 27 [2018-07-23 23:29:17,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:17,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:17,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-07-23 23:29:17,447 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:17,448 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:17,452 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 16 treesize of output 27 [2018-07-23 23:29:17,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:17,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:17,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-07-23 23:29:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:17,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:17,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-07-23 23:29:17,503 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 23:29:17,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 23:29:17,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-07-23 23:29:17,504 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 17 states. [2018-07-23 23:29:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:18,395 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2018-07-23 23:29:18,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 23:29:18,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-07-23 23:29:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:18,400 INFO L225 Difference]: With dead ends: 160 [2018-07-23 23:29:18,400 INFO L226 Difference]: Without dead ends: 144 [2018-07-23 23:29:18,401 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:29:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-23 23:29:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 86. [2018-07-23 23:29:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 23:29:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2018-07-23 23:29:18,419 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 27 [2018-07-23 23:29:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:18,419 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2018-07-23 23:29:18,419 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 23:29:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-07-23 23:29:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 23:29:18,421 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:18,421 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:18,421 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash 181504445, now seen corresponding path program 4 times [2018-07-23 23:29:18,421 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:18,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:18,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:18,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:18,836 WARN L169 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-07-23 23:29:19,148 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2018-07-23 23:29:19,437 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-07-23 23:29:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:19,497 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:19,497 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:19,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:29:19,519 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:29:19,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:19,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:19,645 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:19,646 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 16 treesize of output 21 [2018-07-23 23:29:19,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:19,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:19,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-07-23 23:29:19,707 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:19,708 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:19,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-07-23 23:29:19,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:19,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:29:19,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-07-23 23:29:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:20,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:20,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-07-23 23:29:20,165 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 23:29:20,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 23:29:20,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:29:20,166 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 20 states. [2018-07-23 23:29:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:21,937 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2018-07-23 23:29:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 23:29:21,937 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-07-23 23:29:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:21,938 INFO L225 Difference]: With dead ends: 214 [2018-07-23 23:29:21,939 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 23:29:21,940 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 23:29:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 23:29:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 88. [2018-07-23 23:29:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 23:29:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2018-07-23 23:29:21,951 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 29 [2018-07-23 23:29:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:21,951 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2018-07-23 23:29:21,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 23:29:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2018-07-23 23:29:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 23:29:21,953 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:21,953 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:21,953 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash -824002565, now seen corresponding path program 1 times [2018-07-23 23:29:21,954 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:21,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:22,295 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:22,295 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:22,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:22,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:22,365 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:22,366 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 16 treesize of output 21 [2018-07-23 23:29:22,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:22,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:22,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:29:22,415 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:22,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-07-23 23:29:22,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:22,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:22,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:29:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:22,583 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:22,583 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2018-07-23 23:29:22,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:29:22,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:29:22,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:29:22,584 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand 24 states. [2018-07-23 23:29:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:23,227 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2018-07-23 23:29:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 23:29:23,228 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-07-23 23:29:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:23,229 INFO L225 Difference]: With dead ends: 137 [2018-07-23 23:29:23,229 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 23:29:23,230 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2018-07-23 23:29:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 23:29:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2018-07-23 23:29:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 23:29:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2018-07-23 23:29:23,242 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 30 [2018-07-23 23:29:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:23,242 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2018-07-23 23:29:23,243 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:29:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2018-07-23 23:29:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 23:29:23,244 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:23,244 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:23,245 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1774540049, now seen corresponding path program 3 times [2018-07-23 23:29:23,245 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:23,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:23,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:23,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:23,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:24,534 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:24,534 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:24,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:24,564 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-07-23 23:29:24,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:24,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:24,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:24,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-07-23 23:29:24,714 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:24,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:24,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:24,715 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 12 states. [2018-07-23 23:29:25,198 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-23 23:29:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:25,202 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-07-23 23:29:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 23:29:25,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-07-23 23:29:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:25,206 INFO L225 Difference]: With dead ends: 153 [2018-07-23 23:29:25,206 INFO L226 Difference]: Without dead ends: 133 [2018-07-23 23:29:25,207 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:29:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-23 23:29:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2018-07-23 23:29:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 23:29:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-07-23 23:29:25,227 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 31 [2018-07-23 23:29:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:25,228 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-07-23 23:29:25,228 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-07-23 23:29:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 23:29:25,235 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:25,235 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:25,236 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2117159324, now seen corresponding path program 5 times [2018-07-23 23:29:25,236 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:25,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:25,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:25,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:25,599 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:25,599 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:25,607 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:29:25,624 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-07-23 23:29:25,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:25,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:25,846 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:25,850 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 16 treesize of output 23 [2018-07-23 23:29:25,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:25,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:25,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:29:25,945 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 14 treesize of output 13 [2018-07-23 23:29:25,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:25,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:25,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:29:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:25,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:25,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-07-23 23:29:25,994 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:29:25,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:29:25,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:29:25,995 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 21 states. [2018-07-23 23:29:26,316 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-23 23:29:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:27,870 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2018-07-23 23:29:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 23:29:27,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2018-07-23 23:29:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:27,873 INFO L225 Difference]: With dead ends: 237 [2018-07-23 23:29:27,873 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 23:29:27,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=299, Invalid=1681, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 23:29:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 23:29:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 113. [2018-07-23 23:29:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 23:29:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2018-07-23 23:29:27,886 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 31 [2018-07-23 23:29:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:27,886 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2018-07-23 23:29:27,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:29:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2018-07-23 23:29:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 23:29:27,887 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:27,887 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:27,887 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2086510076, now seen corresponding path program 4 times [2018-07-23 23:29:27,888 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:27,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:27,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:28,132 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:28,133 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:28,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:29:28,152 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:29:28,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:28,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:28,193 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 12 treesize of output 11 [2018-07-23 23:29:28,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:28,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:28,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-07-23 23:29:28,248 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:28,249 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:28,249 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:28,253 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 16 treesize of output 31 [2018-07-23 23:29:28,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:28,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:29:28,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:14 [2018-07-23 23:29:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:28,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:28,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-07-23 23:29:28,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:29:28,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:29:28,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:29:28,443 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 21 states. [2018-07-23 23:29:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:29,352 INFO L93 Difference]: Finished difference Result 240 states and 285 transitions. [2018-07-23 23:29:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 23:29:29,353 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-07-23 23:29:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:29,355 INFO L225 Difference]: With dead ends: 240 [2018-07-23 23:29:29,355 INFO L226 Difference]: Without dead ends: 209 [2018-07-23 23:29:29,357 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=263, Invalid=1219, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 23:29:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-23 23:29:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 134. [2018-07-23 23:29:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-23 23:29:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-07-23 23:29:29,372 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 32 [2018-07-23 23:29:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-07-23 23:29:29,372 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:29:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-07-23 23:29:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 23:29:29,373 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:29,373 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:29,373 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash 811438309, now seen corresponding path program 2 times [2018-07-23 23:29:29,374 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:29,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:29,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:30,032 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:30,032 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:30,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:30,052 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:30,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:30,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:30,073 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,074 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 14 treesize of output 19 [2018-07-23 23:29:30,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-07-23 23:29:30,114 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,115 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,116 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,116 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:30,117 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 54 [2018-07-23 23:29:30,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-07-23 23:29:30,235 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,236 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:30,237 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,237 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:30,238 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:30,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 56 [2018-07-23 23:29:30,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-07-23 23:29:30,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-07-23 23:29:30,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:30,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:29:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:30,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:30,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-07-23 23:29:30,705 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 23:29:30,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 23:29:30,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-07-23 23:29:30,706 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 29 states. [2018-07-23 23:29:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:32,178 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2018-07-23 23:29:32,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 23:29:32,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-07-23 23:29:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:32,179 INFO L225 Difference]: With dead ends: 175 [2018-07-23 23:29:32,179 INFO L226 Difference]: Without dead ends: 164 [2018-07-23 23:29:32,181 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=304, Invalid=1858, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 23:29:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-23 23:29:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-07-23 23:29:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-23 23:29:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-07-23 23:29:32,195 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 34 [2018-07-23 23:29:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-07-23 23:29:32,195 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 23:29:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-07-23 23:29:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 23:29:32,196 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:32,196 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:32,196 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash -240486924, now seen corresponding path program 1 times [2018-07-23 23:29:32,197 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:32,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:32,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:32,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:32,556 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:32,556 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:32,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:32,691 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 12 treesize of output 11 [2018-07-23 23:29:32,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:32,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:32,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:32,755 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:32,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-07-23 23:29:32,756 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 23:29:32,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 23:29:32,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:29:32,757 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 18 states. [2018-07-23 23:29:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:33,936 INFO L93 Difference]: Finished difference Result 373 states and 433 transitions. [2018-07-23 23:29:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 23:29:33,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-07-23 23:29:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:33,938 INFO L225 Difference]: With dead ends: 373 [2018-07-23 23:29:33,938 INFO L226 Difference]: Without dead ends: 331 [2018-07-23 23:29:33,940 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=2382, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 23:29:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-23 23:29:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 161. [2018-07-23 23:29:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 23:29:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-07-23 23:29:33,956 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 35 [2018-07-23 23:29:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:33,957 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-07-23 23:29:33,957 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 23:29:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-07-23 23:29:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 23:29:33,957 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:33,957 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:33,958 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:33,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1276218866, now seen corresponding path program 6 times [2018-07-23 23:29:33,958 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:33,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:33,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:34,365 WARN L169 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-07-23 23:29:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:34,866 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:34,866 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:34,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:29:34,893 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-23 23:29:34,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:34,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:35,007 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,008 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 16 treesize of output 25 [2018-07-23 23:29:35,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-07-23 23:29:35,082 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,083 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-07-23 23:29:35,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-07-23 23:29:35,280 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,281 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,286 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,287 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-07-23 23:29:35,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:29:35,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-07-23 23:29:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:35,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:35,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2018-07-23 23:29:35,366 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:29:35,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:29:35,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:29:35,366 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 26 states. [2018-07-23 23:29:36,064 WARN L169 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-07-23 23:29:37,489 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-07-23 23:29:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:38,263 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2018-07-23 23:29:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 23:29:38,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2018-07-23 23:29:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:38,265 INFO L225 Difference]: With dead ends: 318 [2018-07-23 23:29:38,265 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 23:29:38,266 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=431, Invalid=2431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 23:29:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 23:29:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 194. [2018-07-23 23:29:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 23:29:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2018-07-23 23:29:38,288 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 35 [2018-07-23 23:29:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:38,288 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2018-07-23 23:29:38,288 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:29:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2018-07-23 23:29:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 23:29:38,289 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:38,289 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:38,289 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash -373613836, now seen corresponding path program 2 times [2018-07-23 23:29:38,290 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:38,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:38,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:38,643 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-23 23:29:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:38,860 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:38,860 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:38,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:38,879 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:38,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:38,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:38,902 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:38,903 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 27 [2018-07-23 23:29:38,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:38,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:38,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:32 [2018-07-23 23:29:38,978 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:38,979 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:38,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-07-23 23:29:38,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:38,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:38,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-07-23 23:29:39,026 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:39,027 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:39,027 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:39,028 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:39,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 43 [2018-07-23 23:29:39,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:39,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:39,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:29:39,272 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:39,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-07-23 23:29:39,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:39,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:39,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-07-23 23:29:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:39,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:39,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2018-07-23 23:29:39,328 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:29:39,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:29:39,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:29:39,329 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand 24 states. [2018-07-23 23:29:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:40,172 INFO L93 Difference]: Finished difference Result 330 states and 387 transitions. [2018-07-23 23:29:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 23:29:40,181 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-07-23 23:29:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:40,182 INFO L225 Difference]: With dead ends: 330 [2018-07-23 23:29:40,182 INFO L226 Difference]: Without dead ends: 299 [2018-07-23 23:29:40,183 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 23:29:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-23 23:29:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 178. [2018-07-23 23:29:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-23 23:29:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2018-07-23 23:29:40,207 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 35 [2018-07-23 23:29:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2018-07-23 23:29:40,208 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:29:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2018-07-23 23:29:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 23:29:40,208 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:40,208 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:40,209 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1020833116, now seen corresponding path program 1 times [2018-07-23 23:29:40,209 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:40,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:40,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:40,446 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:40,446 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:40,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:40,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:40,493 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 12 treesize of output 11 [2018-07-23 23:29:40,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:40,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:40,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:40,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:40,617 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2018-07-23 23:29:40,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 23:29:40,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 23:29:40,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:29:40,618 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand 18 states. [2018-07-23 23:29:41,116 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-23 23:29:42,033 WARN L169 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-23 23:29:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:42,073 INFO L93 Difference]: Finished difference Result 306 states and 357 transitions. [2018-07-23 23:29:42,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 23:29:42,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-07-23 23:29:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:42,075 INFO L225 Difference]: With dead ends: 306 [2018-07-23 23:29:42,075 INFO L226 Difference]: Without dead ends: 304 [2018-07-23 23:29:42,076 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 23:29:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-07-23 23:29:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 190. [2018-07-23 23:29:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-23 23:29:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 228 transitions. [2018-07-23 23:29:42,106 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 228 transitions. Word has length 36 [2018-07-23 23:29:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:42,107 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 228 transitions. [2018-07-23 23:29:42,107 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 23:29:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 228 transitions. [2018-07-23 23:29:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 23:29:42,108 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:42,108 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:42,108 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1787159654, now seen corresponding path program 3 times [2018-07-23 23:29:42,108 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:42,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:42,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:42,870 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-07-23 23:29:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:43,081 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:43,081 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:43,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-23 23:29:43,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:43,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:43,163 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:43,163 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 27 [2018-07-23 23:29:43,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2018-07-23 23:29:43,227 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:43,228 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:43,228 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:43,229 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 25 treesize of output 33 [2018-07-23 23:29:43,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-07-23 23:29:43,274 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:43,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-07-23 23:29:43,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:43,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-07-23 23:29:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:43,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:43,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-07-23 23:29:43,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 23:29:43,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 23:29:43,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-07-23 23:29:43,372 INFO L87 Difference]: Start difference. First operand 190 states and 228 transitions. Second operand 25 states. [2018-07-23 23:29:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:44,014 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2018-07-23 23:29:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 23:29:44,015 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-07-23 23:29:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:44,016 INFO L225 Difference]: With dead ends: 228 [2018-07-23 23:29:44,016 INFO L226 Difference]: Without dead ends: 226 [2018-07-23 23:29:44,016 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:29:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-23 23:29:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190. [2018-07-23 23:29:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-23 23:29:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 228 transitions. [2018-07-23 23:29:44,043 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 228 transitions. Word has length 36 [2018-07-23 23:29:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:44,043 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 228 transitions. [2018-07-23 23:29:44,043 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 23:29:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 228 transitions. [2018-07-23 23:29:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 23:29:44,044 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:44,044 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:44,044 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1656704006, now seen corresponding path program 5 times [2018-07-23 23:29:44,044 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:44,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:44,515 WARN L169 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-07-23 23:29:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:44,746 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:44,746 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:44,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:29:44,773 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-07-23 23:29:44,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:44,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:44,824 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:44,827 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 14 treesize of output 19 [2018-07-23 23:29:44,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:44,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:29:44,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:44,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:44,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2018-07-23 23:29:44,932 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:29:44,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:29:44,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:29:44,933 INFO L87 Difference]: Start difference. First operand 190 states and 228 transitions. Second operand 21 states. [2018-07-23 23:29:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:45,646 INFO L93 Difference]: Finished difference Result 288 states and 338 transitions. [2018-07-23 23:29:45,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 23:29:45,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-07-23 23:29:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:45,650 INFO L225 Difference]: With dead ends: 288 [2018-07-23 23:29:45,650 INFO L226 Difference]: Without dead ends: 286 [2018-07-23 23:29:45,650 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 23:29:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-07-23 23:29:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 217. [2018-07-23 23:29:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 23:29:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 259 transitions. [2018-07-23 23:29:45,685 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 259 transitions. Word has length 37 [2018-07-23 23:29:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:45,685 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 259 transitions. [2018-07-23 23:29:45,685 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:29:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 259 transitions. [2018-07-23 23:29:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 23:29:45,685 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:45,686 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:45,686 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1051051313, now seen corresponding path program 4 times [2018-07-23 23:29:45,686 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:45,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:45,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:45,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:45,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:46,102 WARN L169 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-07-23 23:29:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:46,764 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:46,765 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:46,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:29:46,782 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:29:46,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:46,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:46,899 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:46,900 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 27 [2018-07-23 23:29:46,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:46,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:32 [2018-07-23 23:29:47,063 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,086 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-07-23 23:29:47,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-07-23 23:29:47,342 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,343 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,344 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,344 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:47,345 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,347 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 66 [2018-07-23 23:29:47,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:24 [2018-07-23 23:29:47,436 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:47,437 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,438 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,438 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,439 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:47,439 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-07-23 23:29:47,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:24 [2018-07-23 23:29:47,520 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:47,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-07-23 23:29:47,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:47,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-07-23 23:29:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:47,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:47,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 34 [2018-07-23 23:29:47,699 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 23:29:47,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 23:29:47,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 23:29:47,700 INFO L87 Difference]: Start difference. First operand 217 states and 259 transitions. Second operand 34 states. [2018-07-23 23:29:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:48,920 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2018-07-23 23:29:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 23:29:48,921 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2018-07-23 23:29:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:48,922 INFO L225 Difference]: With dead ends: 242 [2018-07-23 23:29:48,922 INFO L226 Difference]: Without dead ends: 231 [2018-07-23 23:29:48,923 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=268, Invalid=1802, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 23:29:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-23 23:29:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 190. [2018-07-23 23:29:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-23 23:29:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2018-07-23 23:29:48,957 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 38 [2018-07-23 23:29:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:48,958 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2018-07-23 23:29:48,958 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 23:29:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2018-07-23 23:29:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:29:48,959 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:48,959 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:48,959 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash -434983154, now seen corresponding path program 1 times [2018-07-23 23:29:48,959 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:48,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:49,441 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-07-23 23:29:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:49,630 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:49,631 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:49,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:49,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:49,692 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:49,693 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 23 [2018-07-23 23:29:49,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:49,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:49,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:29:49,757 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:49,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-07-23 23:29:49,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:49,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:49,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-07-23 23:29:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:49,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:49,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2018-07-23 23:29:49,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:29:49,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:29:49,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:29:49,932 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand 24 states. [2018-07-23 23:29:51,227 WARN L169 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-23 23:29:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:51,905 INFO L93 Difference]: Finished difference Result 298 states and 342 transitions. [2018-07-23 23:29:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 23:29:51,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-07-23 23:29:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:51,907 INFO L225 Difference]: With dead ends: 298 [2018-07-23 23:29:51,907 INFO L226 Difference]: Without dead ends: 296 [2018-07-23 23:29:51,908 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=298, Invalid=2672, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 23:29:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-07-23 23:29:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 194. [2018-07-23 23:29:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 23:29:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2018-07-23 23:29:51,943 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 40 [2018-07-23 23:29:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2018-07-23 23:29:51,943 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:29:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2018-07-23 23:29:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:29:51,944 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:51,944 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:51,944 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash -453974576, now seen corresponding path program 5 times [2018-07-23 23:29:51,944 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:51,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:51,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:51,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:52,357 WARN L169 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-07-23 23:29:52,565 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-07-23 23:29:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:52,945 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:52,945 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:52,952 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:29:52,971 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 23:29:52,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:52,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:53,012 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,013 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 14 treesize of output 19 [2018-07-23 23:29:53,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-07-23 23:29:53,058 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,058 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,059 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,060 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:53,061 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 52 [2018-07-23 23:29:53,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:31 [2018-07-23 23:29:53,161 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,161 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:53,162 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,163 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,164 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:53,164 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:29:53,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 66 [2018-07-23 23:29:53,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:27 [2018-07-23 23:29:53,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-07-23 23:29:53,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-07-23 23:29:53,297 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 14 treesize of output 13 [2018-07-23 23:29:53,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:53,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:29:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:53,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:53,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-07-23 23:29:53,494 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 23:29:53,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 23:29:53,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:29:53,495 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand 31 states. [2018-07-23 23:29:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:54,511 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2018-07-23 23:29:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 23:29:54,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-07-23 23:29:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:54,513 INFO L225 Difference]: With dead ends: 271 [2018-07-23 23:29:54,513 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 23:29:54,514 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=289, Invalid=1873, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 23:29:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 23:29:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-07-23 23:29:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-23 23:29:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-07-23 23:29:54,549 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 40 [2018-07-23 23:29:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:54,549 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-07-23 23:29:54,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 23:29:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-07-23 23:29:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 23:29:54,550 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:54,550 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:54,550 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1580591721, now seen corresponding path program 3 times [2018-07-23 23:29:54,550 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:54,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:54,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:54,675 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:54,675 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:54,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:54,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-07-23 23:29:54,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:54,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:54,715 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,716 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 16 treesize of output 21 [2018-07-23 23:29:54,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-07-23 23:29:54,804 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,805 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,805 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,806 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,807 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 61 [2018-07-23 23:29:54,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,849 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,849 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-07-23 23:29:54,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,882 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-07-23 23:29:54,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:50 [2018-07-23 23:29:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-07-23 23:29:55,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:55,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-07-23 23:29:55,003 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 23:29:55,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 23:29:55,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:29:55,004 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 16 states. [2018-07-23 23:29:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:57,558 INFO L93 Difference]: Finished difference Result 493 states and 586 transitions. [2018-07-23 23:29:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 23:29:57,558 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-07-23 23:29:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:57,560 INFO L225 Difference]: With dead ends: 493 [2018-07-23 23:29:57,560 INFO L226 Difference]: Without dead ends: 437 [2018-07-23 23:29:57,562 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=604, Invalid=3302, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 23:29:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-07-23 23:29:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 194. [2018-07-23 23:29:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 23:29:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2018-07-23 23:29:57,603 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 41 [2018-07-23 23:29:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:57,603 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2018-07-23 23:29:57,603 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 23:29:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2018-07-23 23:29:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 23:29:57,604 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:57,604 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:57,605 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash 949239902, now seen corresponding path program 2 times [2018-07-23 23:29:57,605 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:57,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:57,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:58,210 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:58,210 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:29:58,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:58,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:58,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:58,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:58,272 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 12 treesize of output 11 [2018-07-23 23:29:58,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:58,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:58,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-07-23 23:29:58,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 23:29:58,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 23:29:58,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-07-23 23:29:58,435 INFO L87 Difference]: Start difference. First operand 194 states and 232 transitions. Second operand 22 states. [2018-07-23 23:29:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:59,763 INFO L93 Difference]: Finished difference Result 291 states and 340 transitions. [2018-07-23 23:29:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 23:29:59,763 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-07-23 23:29:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:59,765 INFO L225 Difference]: With dead ends: 291 [2018-07-23 23:29:59,765 INFO L226 Difference]: Without dead ends: 289 [2018-07-23 23:29:59,766 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 23:29:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-23 23:29:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2018-07-23 23:29:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 23:29:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2018-07-23 23:29:59,808 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 41 [2018-07-23 23:29:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:59,809 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2018-07-23 23:29:59,809 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 23:29:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2018-07-23 23:29:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:29:59,810 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:59,810 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:59,810 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1296749628, now seen corresponding path program 6 times [2018-07-23 23:29:59,810 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:59,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:59,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:00,255 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:00,255 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:00,262 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:30:00,296 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-07-23 23:30:00,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:00,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:00,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:00,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-07-23 23:30:00,428 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 23:30:00,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 23:30:00,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-23 23:30:00,429 INFO L87 Difference]: Start difference. First operand 194 states and 232 transitions. Second operand 15 states. [2018-07-23 23:30:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:00,691 INFO L93 Difference]: Finished difference Result 295 states and 346 transitions. [2018-07-23 23:30:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 23:30:00,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-07-23 23:30:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:00,692 INFO L225 Difference]: With dead ends: 295 [2018-07-23 23:30:00,692 INFO L226 Difference]: Without dead ends: 270 [2018-07-23 23:30:00,692 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:30:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-07-23 23:30:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 211. [2018-07-23 23:30:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-23 23:30:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2018-07-23 23:30:00,726 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 42 [2018-07-23 23:30:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:00,727 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2018-07-23 23:30:00,727 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 23:30:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2018-07-23 23:30:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:30:00,727 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:00,727 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:00,728 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash -401969969, now seen corresponding path program 3 times [2018-07-23 23:30:00,728 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:00,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:00,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:00,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:01,253 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-07-23 23:30:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:01,672 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:01,672 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:30:01,702 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-23 23:30:01,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:01,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:01,757 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 12 treesize of output 11 [2018-07-23 23:30:01,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-07-23 23:30:01,873 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:01,876 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:01,884 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 16 treesize of output 27 [2018-07-23 23:30:01,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-07-23 23:30:01,930 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 14 treesize of output 13 [2018-07-23 23:30:01,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:30:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:02,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:02,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2018-07-23 23:30:02,017 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:30:02,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:30:02,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:30:02,018 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand 21 states. [2018-07-23 23:30:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:02,864 INFO L93 Difference]: Finished difference Result 296 states and 342 transitions. [2018-07-23 23:30:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 23:30:02,864 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-07-23 23:30:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:02,866 INFO L225 Difference]: With dead ends: 296 [2018-07-23 23:30:02,866 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 23:30:02,867 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 23:30:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 23:30:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 221. [2018-07-23 23:30:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 23:30:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2018-07-23 23:30:02,920 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 42 [2018-07-23 23:30:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:02,921 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2018-07-23 23:30:02,921 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:30:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2018-07-23 23:30:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:30:02,922 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:02,922 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:02,922 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2022958001, now seen corresponding path program 4 times [2018-07-23 23:30:02,922 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:02,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:02,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:02,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:02,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:03,348 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:03,348 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:30:03,371 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:30:03,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:03,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:03,466 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:03,467 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 16 treesize of output 23 [2018-07-23 23:30:03,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:03,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:03,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:30:03,517 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:03,518 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:03,520 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 16 treesize of output 27 [2018-07-23 23:30:03,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:03,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:03,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-07-23 23:30:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:03,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:03,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 26 [2018-07-23 23:30:03,682 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:30:03,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:30:03,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:30:03,683 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand 26 states. [2018-07-23 23:30:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:04,818 INFO L93 Difference]: Finished difference Result 347 states and 401 transitions. [2018-07-23 23:30:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 23:30:04,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-07-23 23:30:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:04,820 INFO L225 Difference]: With dead ends: 347 [2018-07-23 23:30:04,821 INFO L226 Difference]: Without dead ends: 345 [2018-07-23 23:30:04,822 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 23:30:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-07-23 23:30:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 259. [2018-07-23 23:30:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 23:30:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 307 transitions. [2018-07-23 23:30:04,872 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 307 transitions. Word has length 42 [2018-07-23 23:30:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:04,872 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 307 transitions. [2018-07-23 23:30:04,872 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:30:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 307 transitions. [2018-07-23 23:30:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:30:04,873 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:04,873 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:04,873 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 777180305, now seen corresponding path program 6 times [2018-07-23 23:30:04,874 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:04,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:05,481 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:05,481 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:05,488 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:30:05,508 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-23 23:30:05,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:05,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:05,532 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,533 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 27 [2018-07-23 23:30:05,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:29 [2018-07-23 23:30:05,622 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,622 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:05,623 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,624 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 25 treesize of output 33 [2018-07-23 23:30:05,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-07-23 23:30:05,715 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,716 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,718 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,719 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 41 [2018-07-23 23:30:05,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:30:05,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2018-07-23 23:30:05,808 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,809 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,810 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,811 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 41 [2018-07-23 23:30:05,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:30:05,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-07-23 23:30:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:06,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:06,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 31 [2018-07-23 23:30:06,004 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 23:30:06,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 23:30:06,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:30:06,005 INFO L87 Difference]: Start difference. First operand 259 states and 307 transitions. Second operand 31 states. [2018-07-23 23:30:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:07,436 INFO L93 Difference]: Finished difference Result 332 states and 387 transitions. [2018-07-23 23:30:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 23:30:07,437 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2018-07-23 23:30:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:07,439 INFO L225 Difference]: With dead ends: 332 [2018-07-23 23:30:07,439 INFO L226 Difference]: Without dead ends: 330 [2018-07-23 23:30:07,440 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=378, Invalid=1974, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 23:30:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-07-23 23:30:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 259. [2018-07-23 23:30:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 23:30:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 307 transitions. [2018-07-23 23:30:07,494 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 307 transitions. Word has length 42 [2018-07-23 23:30:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:07,494 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 307 transitions. [2018-07-23 23:30:07,494 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 23:30:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 307 transitions. [2018-07-23 23:30:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 23:30:07,495 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:07,495 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:07,495 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -633374917, now seen corresponding path program 7 times [2018-07-23 23:30:07,495 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:07,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:07,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:07,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:08,014 WARN L169 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-07-23 23:30:08,331 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-07-23 23:30:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:08,545 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:08,545 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:08,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:08,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:08,596 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:08,599 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 12 treesize of output 15 [2018-07-23 23:30:08,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-07-23 23:30:08,632 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 14 treesize of output 13 [2018-07-23 23:30:08,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:08,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:30:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:08,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:08,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-07-23 23:30:08,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 23:30:08,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 23:30:08,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-07-23 23:30:08,805 INFO L87 Difference]: Start difference. First operand 259 states and 307 transitions. Second operand 23 states. [2018-07-23 23:30:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:09,836 INFO L93 Difference]: Finished difference Result 386 states and 454 transitions. [2018-07-23 23:30:09,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 23:30:09,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-07-23 23:30:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:09,838 INFO L225 Difference]: With dead ends: 386 [2018-07-23 23:30:09,838 INFO L226 Difference]: Without dead ends: 384 [2018-07-23 23:30:09,839 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 23:30:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-07-23 23:30:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 291. [2018-07-23 23:30:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-23 23:30:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 344 transitions. [2018-07-23 23:30:09,905 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 344 transitions. Word has length 43 [2018-07-23 23:30:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:09,905 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 344 transitions. [2018-07-23 23:30:09,905 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 23:30:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 344 transitions. [2018-07-23 23:30:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 23:30:09,906 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:09,906 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:09,906 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:09,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1312438664, now seen corresponding path program 2 times [2018-07-23 23:30:09,907 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:09,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:09,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:09,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:09,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:10,569 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:10,569 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:10,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:30:10,594 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:30:10,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:10,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:10,675 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:10,677 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 14 treesize of output 19 [2018-07-23 23:30:10,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:10,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:10,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:30:10,704 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 14 treesize of output 13 [2018-07-23 23:30:10,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:10,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:10,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-07-23 23:30:11,453 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:11,466 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:11,538 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-07-23 23:30:11,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 32 [2018-07-23 23:30:11,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:11,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:11,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:30:12,129 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:12,130 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:12,131 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:12,131 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:12,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 48 [2018-07-23 23:30:12,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:12,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:12,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2018-07-23 23:30:12,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-07-23 23:30:12,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:12,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:12,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:30:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:12,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:12,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 32 [2018-07-23 23:30:12,388 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 23:30:12,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 23:30:12,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2018-07-23 23:30:12,389 INFO L87 Difference]: Start difference. First operand 291 states and 344 transitions. Second operand 32 states. [2018-07-23 23:30:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:13,649 INFO L93 Difference]: Finished difference Result 392 states and 453 transitions. [2018-07-23 23:30:13,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 23:30:13,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-07-23 23:30:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:13,652 INFO L225 Difference]: With dead ends: 392 [2018-07-23 23:30:13,652 INFO L226 Difference]: Without dead ends: 390 [2018-07-23 23:30:13,653 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=231, Invalid=2219, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 23:30:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-07-23 23:30:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 309. [2018-07-23 23:30:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-23 23:30:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 365 transitions. [2018-07-23 23:30:13,744 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 365 transitions. Word has length 44 [2018-07-23 23:30:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:13,745 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 365 transitions. [2018-07-23 23:30:13,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 23:30:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 365 transitions. [2018-07-23 23:30:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 23:30:13,746 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:13,746 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:13,746 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 545060922, now seen corresponding path program 7 times [2018-07-23 23:30:13,747 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:13,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:14,736 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:14,737 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:14,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:14,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:14,785 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,786 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 27 [2018-07-23 23:30:14,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:14,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:14,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:29 [2018-07-23 23:30:14,859 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,860 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-07-23 23:30:14,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:14,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:14,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-07-23 23:30:14,910 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,911 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,912 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,913 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:14,914 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,915 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:14,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 72 [2018-07-23 23:30:14,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:14,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:14,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:33 [2018-07-23 23:30:15,031 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,032 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:15,032 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,033 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,034 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,034 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:15,035 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 74 [2018-07-23 23:30:15,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:15,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:15,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:29 [2018-07-23 23:30:15,160 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-07-23 23:30:15,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:15,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:15,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-07-23 23:30:15,203 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:15,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-07-23 23:30:15,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:15,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:15,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-07-23 23:30:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:15,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:15,411 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-07-23 23:30:15,411 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 23:30:15,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 23:30:15,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 23:30:15,412 INFO L87 Difference]: Start difference. First operand 309 states and 365 transitions. Second operand 35 states. [2018-07-23 23:30:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:16,329 INFO L93 Difference]: Finished difference Result 349 states and 409 transitions. [2018-07-23 23:30:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 23:30:16,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-07-23 23:30:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:16,331 INFO L225 Difference]: With dead ends: 349 [2018-07-23 23:30:16,332 INFO L226 Difference]: Without dead ends: 338 [2018-07-23 23:30:16,332 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=1686, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 23:30:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-07-23 23:30:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 290. [2018-07-23 23:30:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-07-23 23:30:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 343 transitions. [2018-07-23 23:30:16,395 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 343 transitions. Word has length 44 [2018-07-23 23:30:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 343 transitions. [2018-07-23 23:30:16,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 23:30:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 343 transitions. [2018-07-23 23:30:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:30:16,396 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:16,396 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:16,396 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash -482077132, now seen corresponding path program 3 times [2018-07-23 23:30:16,397 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:16,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:16,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 23:30:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 23:30:16,443 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 23:30:16,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 11:30:16 BoogieIcfgContainer [2018-07-23 23:30:16,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 23:30:16,473 INFO L168 Benchmark]: Toolchain (without parser) took 72965.45 ms. Allocated memory was 1.6 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -952.2 MB). Peak memory consumption was 252.1 MB. Max. memory is 7.1 GB. [2018-07-23 23:30:16,474 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 23:30:16,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.30 ms. Allocated memory is still 1.6 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-07-23 23:30:16,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.42 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 23:30:16,475 INFO L168 Benchmark]: Boogie Preprocessor took 43.44 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 23:30:16,475 INFO L168 Benchmark]: RCFGBuilder took 518.21 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-07-23 23:30:16,475 INFO L168 Benchmark]: TraceAbstraction took 72052.86 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 457.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -156.0 MB). Peak memory consumption was 301.7 MB. Max. memory is 7.1 GB. [2018-07-23 23:30:16,477 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.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.30 ms. Allocated memory is still 1.6 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 44.42 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.44 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 518.21 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72052.86 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 457.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -156.0 MB). Peak memory consumption was 301.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] j++ [L14] COND TRUE j=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] v[i+1] = v[i] [L20] i = i - 1 [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] j++ [L14] COND FALSE !(j