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_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 23:29:28,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 23:29:28,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 23:29:28,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 23:29:28,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 23:29:28,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 23:29:28,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 23:29:28,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 23:29:28,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 23:29:28,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 23:29:28,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 23:29:28,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 23:29:28,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 23:29:28,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 23:29:28,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 23:29:28,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 23:29:28,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 23:29:28,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 23:29:28,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 23:29:28,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 23:29:28,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 23:29:28,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 23:29:28,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 23:29:28,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 23:29:28,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 23:29:28,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 23:29:28,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 23:29:28,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 23:29:28,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 23:29:28,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 23:29:28,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 23:29:28,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 23:29:28,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 23:29:28,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 23:29:28,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 23:29:28,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 23:29:28,922 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:28,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 23:29:28,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 23:29:28,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 23:29:28,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-23 23:29:28,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-23 23:29:28,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-23 23:29:28,949 INFO L133 SettingsManager]: * Use SBE=true [2018-07-23 23:29:28,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 23:29:28,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 23:29:28,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 23:29:28,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 23:29:28,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 23:29:28,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 23:29:28,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 23:29:28,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 23:29:28,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 23:29:28,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 23:29:28,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 23:29:28,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 23:29:28,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 23:29:28,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 23:29:28,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 23:29:28,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 23:29:28,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-23 23:29:28,957 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 23:29:28,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 23:29:28,957 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 23:29:28,957 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 23:29:29,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 23:29:29,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 23:29:29,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 23:29:29,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 23:29:29,042 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 23:29:29,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-07-23 23:29:29,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045fcbf7/71c3b60ac5624e59be3d14ab5e6b409e/FLAGfa8cf12be [2018-07-23 23:29:29,575 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 23:29:29,575 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-07-23 23:29:29,584 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045fcbf7/71c3b60ac5624e59be3d14ab5e6b409e/FLAGfa8cf12be [2018-07-23 23:29:29,600 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6045fcbf7/71c3b60ac5624e59be3d14ab5e6b409e [2018-07-23 23:29:29,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 23:29:29,614 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 23:29:29,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 23:29:29,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 23:29:29,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 23:29:29,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:29:29" (1/1) ... [2018-07-23 23:29:29,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8b2370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:29, skipping insertion in model container [2018-07-23 23:29:29,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:29:29" (1/1) ... [2018-07-23 23:29:29,803 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 23:29:29,861 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 23:29:29,877 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 23:29:29,890 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 23:29:29,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:29 WrapperNode [2018-07-23 23:29:29,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 23:29:29,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 23:29:29,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 23:29:29,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 23:29:29,917 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:29" (1/1) ... [2018-07-23 23:29:29,927 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:29" (1/1) ... [2018-07-23 23:29:29,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 23:29:29,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 23:29:29,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 23:29:29,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 23:29:29,958 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:29" (1/1) ... [2018-07-23 23:29:29,959 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:29" (1/1) ... [2018-07-23 23:29:29,960 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:29" (1/1) ... [2018-07-23 23:29:29,960 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:29" (1/1) ... [2018-07-23 23:29:29,962 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:29" (1/1) ... [2018-07-23 23:29:29,969 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:29" (1/1) ... [2018-07-23 23:29:29,970 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:29" (1/1) ... [2018-07-23 23:29:29,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 23:29:29,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 23:29:29,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 23:29:29,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 23:29:29,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:29" (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:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 23:29:30,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 23:29:30,431 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 23:29:30,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:29:30 BoogieIcfgContainer [2018-07-23 23:29:30,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 23:29:30,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 23:29:30,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 23:29:30,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 23:29:30,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 11:29:29" (1/3) ... [2018-07-23 23:29:30,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db034c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:29:30, skipping insertion in model container [2018-07-23 23:29:30,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:29:29" (2/3) ... [2018-07-23 23:29:30,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db034c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:29:30, skipping insertion in model container [2018-07-23 23:29:30,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:29:30" (3/3) ... [2018-07-23 23:29:30,440 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-07-23 23:29:30,449 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 23:29:30,456 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 23:29:30,508 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 23:29:30,508 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 23:29:30,509 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 23:29:30,509 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 23:29:30,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 23:29:30,509 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 23:29:30,509 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 23:29:30,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 23:29:30,510 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 23:29:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-07-23 23:29:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 23:29:30,533 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:30,534 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:30,534 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:30,540 INFO L82 PathProgramCache]: Analyzing trace with hash 827509932, now seen corresponding path program 1 times [2018-07-23 23:29:30,542 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:30,647 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:30,650 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 23:29:30,651 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 23:29:30,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-23 23:29:30,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-23 23:29:30,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-23 23:29:30,675 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-07-23 23:29:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:30,694 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2018-07-23 23:29:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-23 23:29:30,696 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-07-23 23:29:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:30,707 INFO L225 Difference]: With dead ends: 38 [2018-07-23 23:29:30,707 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 23:29:30,711 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:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 23:29:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 23:29:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 23:29:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-07-23 23:29:30,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2018-07-23 23:29:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:30,751 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-07-23 23:29:30,751 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-23 23:29:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-07-23 23:29:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 23:29:30,752 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:30,752 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:30,752 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash 311568672, now seen corresponding path program 1 times [2018-07-23 23:29:30,753 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:30,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:30,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:30,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:30,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:30,906 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:30,907 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 23:29:30,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 23:29:30,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 23:29:30,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 23:29:30,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 23:29:30,910 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-07-23 23:29:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:31,081 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-07-23 23:29:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 23:29:31,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-07-23 23:29:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:31,082 INFO L225 Difference]: With dead ends: 32 [2018-07-23 23:29:31,083 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 23:29:31,086 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:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 23:29:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-07-23 23:29:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 23:29:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-07-23 23:29:31,091 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2018-07-23 23:29:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-07-23 23:29:31,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 23:29:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-07-23 23:29:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 23:29:31,092 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:31,093 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:31,093 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash 701530805, now seen corresponding path program 1 times [2018-07-23 23:29:31,094 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:31,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:31,533 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-07-23 23:29:31,647 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:31,648 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:31,648 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:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:31,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:31,854 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:31,867 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:31,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:31,934 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:31,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:32,079 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:32,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:32,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-07-23 23:29:32,102 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:32,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:32,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:32,103 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 12 states. [2018-07-23 23:29:32,686 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-23 23:29:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:32,922 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-07-23 23:29:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 23:29:32,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-23 23:29:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:32,924 INFO L225 Difference]: With dead ends: 48 [2018-07-23 23:29:32,925 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 23:29:32,926 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 23:29:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 23:29:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2018-07-23 23:29:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 23:29:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-07-23 23:29:32,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-07-23 23:29:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:32,933 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-07-23 23:29:32,934 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-07-23 23:29:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 23:29:32,935 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:32,935 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:32,935 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1955559665, now seen corresponding path program 1 times [2018-07-23 23:29:32,936 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:32,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:32,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:32,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:33,255 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:33,256 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:33,256 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:33,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:33,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:33,338 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:33,339 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 20 treesize of output 27 [2018-07-23 23:29:33,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:33,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:33,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-07-23 23:29:33,389 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:33,391 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:33,393 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:33,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:33,411 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:33,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-07-23 23:29:33,481 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:33,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:33,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-07-23 23:29:33,507 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 23:29:33,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 23:29:33,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 23:29:33,509 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2018-07-23 23:29:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:33,865 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-07-23 23:29:33,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 23:29:33,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-23 23:29:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:33,873 INFO L225 Difference]: With dead ends: 73 [2018-07-23 23:29:33,873 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 23:29:33,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-07-23 23:29:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 23:29:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 30. [2018-07-23 23:29:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 23:29:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-07-23 23:29:33,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-07-23 23:29:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:33,882 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-07-23 23:29:33,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 23:29:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-07-23 23:29:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 23:29:33,883 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:33,883 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:33,884 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1731885914, now seen corresponding path program 1 times [2018-07-23 23:29:33,884 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:33,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:33,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:33,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:34,128 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:34,128 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:34,129 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:34,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:34,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:34,262 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:34,284 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:34,284 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-07-23 23:29:34,285 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 23:29:34,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 23:29:34,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-07-23 23:29:34,286 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 9 states. [2018-07-23 23:29:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:34,733 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-07-23 23:29:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 23:29:34,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-07-23 23:29:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:34,734 INFO L225 Difference]: With dead ends: 45 [2018-07-23 23:29:34,735 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 23:29:34,736 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 23:29:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-07-23 23:29:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 23:29:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-07-23 23:29:34,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-07-23 23:29:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:34,741 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-07-23 23:29:34,741 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 23:29:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-07-23 23:29:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 23:29:34,742 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:34,742 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:34,742 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash 791189642, now seen corresponding path program 2 times [2018-07-23 23:29:34,743 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:34,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:34,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:35,188 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:35,188 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:35,188 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:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:35,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:35,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:35,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:35,264 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:35,266 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:35,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,288 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,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:35,336 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:35,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:35,345 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,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:29:35,409 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:35,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:35,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-07-23 23:29:35,430 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:35,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:35,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:35,431 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 12 states. [2018-07-23 23:29:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:35,765 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-07-23 23:29:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 23:29:35,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 23:29:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:35,766 INFO L225 Difference]: With dead ends: 59 [2018-07-23 23:29:35,767 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 23:29:35,767 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-07-23 23:29:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 23:29:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-07-23 23:29:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 23:29:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-07-23 23:29:35,774 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 21 [2018-07-23 23:29:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:35,774 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-07-23 23:29:35,775 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-07-23 23:29:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 23:29:35,776 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:35,776 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:35,776 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1692763228, now seen corresponding path program 2 times [2018-07-23 23:29:35,776 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:35,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:35,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:35,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:36,091 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:36,091 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:36,092 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:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:36,114 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:36,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:36,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:36,170 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:36,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:36,177 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:36,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:36,283 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:36,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:36,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-07-23 23:29:36,306 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:36,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:36,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:36,307 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 12 states. [2018-07-23 23:29:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:36,830 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-07-23 23:29:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 23:29:36,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-07-23 23:29:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:36,833 INFO L225 Difference]: With dead ends: 98 [2018-07-23 23:29:36,833 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 23:29:36,834 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2018-07-23 23:29:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 23:29:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 44. [2018-07-23 23:29:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 23:29:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-07-23 23:29:36,842 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 23 [2018-07-23 23:29:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:36,842 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-07-23 23:29:36,842 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-07-23 23:29:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 23:29:36,844 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:36,844 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:36,844 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:36,844 INFO L82 PathProgramCache]: Analyzing trace with hash 178680164, now seen corresponding path program 3 times [2018-07-23 23:29:36,844 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:36,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:36,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:36,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:37,196 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:37,197 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:37,197 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:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:37,220 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 23:29:37,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:37,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:37,231 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:37,233 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 25 [2018-07-23 23:29:37,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:27 [2018-07-23 23:29:37,291 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:37,292 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:37,293 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 25 treesize of output 26 [2018-07-23 23:29:37,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,304 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:37,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-07-23 23:29:37,375 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:37,376 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:37,377 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:37,380 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:37,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:37,400 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:37,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:29:37,492 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:37,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:37,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-07-23 23:29:37,513 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 23:29:37,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 23:29:37,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:29:37,514 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 16 states. [2018-07-23 23:29:38,258 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-07-23 23:29:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:38,327 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-07-23 23:29:38,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 23:29:38,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 23:29:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:38,331 INFO L225 Difference]: With dead ends: 94 [2018-07-23 23:29:38,332 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 23:29:38,333 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:29:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 23:29:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 50. [2018-07-23 23:29:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 23:29:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-07-23 23:29:38,342 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 23 [2018-07-23 23:29:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:38,342 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-07-23 23:29:38,342 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 23:29:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-07-23 23:29:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 23:29:38,344 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:38,344 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:38,344 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash -769654722, now seen corresponding path program 4 times [2018-07-23 23:29:38,345 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:38,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:38,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:38,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:38,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:38,687 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:38,688 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:38,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:29:38,709 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:29:38,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:38,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:38,769 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:38,770 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 20 treesize of output 27 [2018-07-23 23:29:38,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:38,783 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,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-07-23 23:29:38,848 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:38,849 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:38,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 27 treesize of output 30 [2018-07-23 23:29:38,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:38,865 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:38,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-07-23 23:29:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:39,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:39,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-07-23 23:29:39,006 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 23:29:39,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 23:29:39,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:29:39,008 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 18 states. [2018-07-23 23:29:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:40,585 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-07-23 23:29:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 23:29:40,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-23 23:29:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:40,587 INFO L225 Difference]: With dead ends: 142 [2018-07-23 23:29:40,587 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 23:29:40,589 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 23:29:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 23:29:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 52. [2018-07-23 23:29:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 23:29:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-07-23 23:29:40,599 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 25 [2018-07-23 23:29:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:40,599 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-07-23 23:29:40,599 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 23:29:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-07-23 23:29:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 23:29:40,600 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:40,600 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:40,600 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1806355441, now seen corresponding path program 2 times [2018-07-23 23:29:40,601 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:40,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:40,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:40,816 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:40,816 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:40,816 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:40,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:40,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:40,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:40,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:40,882 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,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:40,895 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,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:41,129 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:41,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:41,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-07-23 23:29:41,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 23:29:41,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 23:29:41,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:29:41,151 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 20 states. [2018-07-23 23:29:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:41,667 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-07-23 23:29:41,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 23:29:41,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-07-23 23:29:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:41,669 INFO L225 Difference]: With dead ends: 91 [2018-07-23 23:29:41,669 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 23:29:41,670 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:29:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 23:29:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2018-07-23 23:29:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 23:29:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-07-23 23:29:41,686 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 26 [2018-07-23 23:29:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:41,686 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-07-23 23:29:41,687 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 23:29:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-07-23 23:29:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 23:29:41,688 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:41,688 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:41,688 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1192478049, now seen corresponding path program 3 times [2018-07-23 23:29:41,689 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:41,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:41,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:41,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:41,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:42,129 WARN L169 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-07-23 23:29:42,416 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:42,417 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:42,417 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:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:42,480 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 23:29:42,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:42,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:42,635 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:42,655 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:42,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:42,737 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:42,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:29:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:42,778 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:42,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:42,789 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:42,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-07-23 23:29:42,848 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:42,873 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:42,922 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-07-23 23:29:42,923 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:42,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:42,935 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:42,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-07-23 23:29:42,973 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:42,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:42,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-07-23 23:29:42,996 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 23:29:42,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 23:29:42,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-07-23 23:29:42,997 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 17 states. [2018-07-23 23:29:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:43,696 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2018-07-23 23:29:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 23:29:43,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-07-23 23:29:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:43,698 INFO L225 Difference]: With dead ends: 134 [2018-07-23 23:29:43,698 INFO L226 Difference]: Without dead ends: 132 [2018-07-23 23:29:43,699 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2018-07-23 23:29:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-23 23:29:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 74. [2018-07-23 23:29:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 23:29:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2018-07-23 23:29:43,710 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 27 [2018-07-23 23:29:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2018-07-23 23:29:43,710 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 23:29:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2018-07-23 23:29:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 23:29:43,711 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:43,711 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:43,712 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:43,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1456261399, now seen corresponding path program 1 times [2018-07-23 23:29:43,712 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:43,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:43,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:44,510 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:44,510 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:44,511 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:44,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:44,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:44,582 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 13 [2018-07-23 23:29:44,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:44,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:44,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-07-23 23:29:44,643 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:44,644 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:44,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:44,650 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:44,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:29:44,776 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:44,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:44,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-07-23 23:29:44,796 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 23:29:44,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 23:29:44,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:29:44,797 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 20 states. [2018-07-23 23:29:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:45,242 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-07-23 23:29:45,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 23:29:45,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-07-23 23:29:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:45,243 INFO L225 Difference]: With dead ends: 115 [2018-07-23 23:29:45,243 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 23:29:45,244 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-07-23 23:29:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 23:29:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2018-07-23 23:29:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 23:29:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-07-23 23:29:45,256 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 28 [2018-07-23 23:29:45,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:45,257 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-07-23 23:29:45,257 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 23:29:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-07-23 23:29:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 23:29:45,258 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:45,258 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:45,258 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 839508537, now seen corresponding path program 5 times [2018-07-23 23:29:45,259 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:45,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:45,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:45,663 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:45,664 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:45,664 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:45,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:29:45,690 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-07-23 23:29:45,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:45,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:45,849 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:45,851 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:45,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:45,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:45,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:29:45,942 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:45,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:45,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:45,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:29:45,980 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:46,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:46,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-07-23 23:29:46,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:29:46,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:29:46,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:29:46,001 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 21 states. [2018-07-23 23:29:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:47,540 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2018-07-23 23:29:47,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 23:29:47,541 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-07-23 23:29:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:47,542 INFO L225 Difference]: With dead ends: 196 [2018-07-23 23:29:47,542 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 23:29:47,543 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 23:29:47,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 23:29:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 82. [2018-07-23 23:29:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 23:29:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-07-23 23:29:47,557 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 29 [2018-07-23 23:29:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:47,558 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-07-23 23:29:47,558 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:29:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-07-23 23:29:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 23:29:47,559 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:47,559 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:47,559 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 23336125, now seen corresponding path program 2 times [2018-07-23 23:29:47,560 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:47,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:47,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:48,068 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:48,069 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:48,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:48,093 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:48,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:48,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:48,137 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:48,139 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:48,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:48,148 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:48,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-07-23 23:29:48,184 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 15 [2018-07-23 23:29:48,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:48,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:48,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:29:48,325 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-07-23 23:29:48,326 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 23 treesize of output 18 [2018-07-23 23:29:48,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:48,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:48,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:29:48,611 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:48,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:48,616 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:48,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:29:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:48,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:48,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-07-23 23:29:48,776 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 23:29:48,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 23:29:48,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-07-23 23:29:48,777 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 25 states. [2018-07-23 23:29:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:49,829 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-07-23 23:29:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 23:29:49,829 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-07-23 23:29:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:49,830 INFO L225 Difference]: With dead ends: 155 [2018-07-23 23:29:49,831 INFO L226 Difference]: Without dead ends: 153 [2018-07-23 23:29:49,832 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 23:29:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-23 23:29:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 90. [2018-07-23 23:29:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 23:29:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-07-23 23:29:49,845 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 30 [2018-07-23 23:29:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:49,846 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-07-23 23:29:49,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 23:29:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-07-23 23:29:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 23:29:49,847 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:49,847 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:49,847 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1733533930, now seen corresponding path program 3 times [2018-07-23 23:29:49,848 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:49,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:49,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:50,105 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:50,106 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:50,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 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:50,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:50,168 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-07-23 23:29:50,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:50,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:50,341 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:50,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:50,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-07-23 23:29:50,361 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 23:29:50,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 23:29:50,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-07-23 23:29:50,362 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 12 states. [2018-07-23 23:29:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:50,853 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2018-07-23 23:29:50,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 23:29:50,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-07-23 23:29:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:50,854 INFO L225 Difference]: With dead ends: 129 [2018-07-23 23:29:50,854 INFO L226 Difference]: Without dead ends: 109 [2018-07-23 23:29:50,855 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:29:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-23 23:29:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2018-07-23 23:29:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 23:29:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2018-07-23 23:29:50,868 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 31 [2018-07-23 23:29:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:50,868 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2018-07-23 23:29:50,868 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 23:29:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2018-07-23 23:29:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 23:29:50,869 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:50,870 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:50,870 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1368748077, now seen corresponding path program 6 times [2018-07-23 23:29:50,870 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:50,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:50,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:51,216 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:51,216 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:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:29:51,251 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-07-23 23:29:51,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:51,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:51,321 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:51,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:51,327 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:51,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:29:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:51,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:51,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-07-23 23:29:51,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 23:29:51,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 23:29:51,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-07-23 23:29:51,425 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 14 states. [2018-07-23 23:29:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:52,312 INFO L93 Difference]: Finished difference Result 235 states and 271 transitions. [2018-07-23 23:29:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 23:29:52,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-07-23 23:29:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:52,314 INFO L225 Difference]: With dead ends: 235 [2018-07-23 23:29:52,314 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 23:29:52,315 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=1745, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 23:29:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 23:29:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 109. [2018-07-23 23:29:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 23:29:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2018-07-23 23:29:52,330 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 31 [2018-07-23 23:29:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:52,330 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2018-07-23 23:29:52,330 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 23:29:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2018-07-23 23:29:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 23:29:52,331 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:52,331 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:52,331 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash -631501997, now seen corresponding path program 7 times [2018-07-23 23:29:52,332 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:52,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:52,662 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:52,662 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:52,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:52,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:52,776 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:52,777 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 20 treesize of output 27 [2018-07-23 23:29:52,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:52,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:52,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-07-23 23:29:52,824 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:52,825 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:52,826 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 34 [2018-07-23 23:29:52,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:52,838 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:52,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-07-23 23:29:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:52,890 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:52,890 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:52,893 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:52,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:52,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:29:52,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:29:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:52,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:52,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-07-23 23:29:52,959 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:29:52,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:29:52,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:29:52,960 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand 21 states. [2018-07-23 23:29:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:53,586 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-07-23 23:29:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 23:29:53,586 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2018-07-23 23:29:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:53,588 INFO L225 Difference]: With dead ends: 163 [2018-07-23 23:29:53,588 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 23:29:53,589 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 23:29:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 23:29:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 103. [2018-07-23 23:29:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 23:29:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-07-23 23:29:53,603 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 31 [2018-07-23 23:29:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:53,603 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-07-23 23:29:53,603 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:29:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-07-23 23:29:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 23:29:53,604 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:53,604 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:53,604 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -789951661, now seen corresponding path program 8 times [2018-07-23 23:29:53,605 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:53,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:53,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:29:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:54,175 WARN L169 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-07-23 23:29:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:54,438 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:54,438 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:54,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:29:54,464 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:29:54,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:54,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:54,481 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,481 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 25 [2018-07-23 23:29:54,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,493 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,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:30 [2018-07-23 23:29:54,522 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,523 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,524 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 25 treesize of output 26 [2018-07-23 23:29:54,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,535 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:54,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:29:54,558 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,560 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,560 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,562 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,565 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:54,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,581 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:54,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:29:54,679 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-07-23 23:29:54,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,753 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,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:29:54,781 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:54,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-07-23 23:29:54,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:54,791 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:54,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-07-23 23:29:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:54,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:54,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-07-23 23:29:54,844 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 23:29:54,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 23:29:54,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-07-23 23:29:54,845 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 17 states. [2018-07-23 23:29:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:55,607 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-07-23 23:29:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 23:29:55,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-07-23 23:29:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:55,608 INFO L225 Difference]: With dead ends: 153 [2018-07-23 23:29:55,608 INFO L226 Difference]: Without dead ends: 151 [2018-07-23 23:29:55,609 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-07-23 23:29:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-23 23:29:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2018-07-23 23:29:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 23:29:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-07-23 23:29:55,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 31 [2018-07-23 23:29:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:55,626 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-07-23 23:29:55,626 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 23:29:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-07-23 23:29:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 23:29:55,627 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:55,627 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:55,627 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 414330620, now seen corresponding path program 4 times [2018-07-23 23:29:55,628 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:55,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:55,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:55,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:55,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:56,134 WARN L169 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-07-23 23:29:56,462 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:56,463 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:56,463 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:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:29:56,493 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:29:56,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:56,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:56,513 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:56,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:56,523 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:56,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-07-23 23:29:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:56,606 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:56,609 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:56,615 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:56,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:56,691 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:56,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:14 [2018-07-23 23:29:56,849 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:56,869 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:56,869 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-07-23 23:29:56,870 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:29:56,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:29:56,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:29:56,871 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 21 states. [2018-07-23 23:29:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:29:57,750 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2018-07-23 23:29:57,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 23:29:57,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-07-23 23:29:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:29:57,751 INFO L225 Difference]: With dead ends: 183 [2018-07-23 23:29:57,751 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 23:29:57,752 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 23:29:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 23:29:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 127. [2018-07-23 23:29:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 23:29:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-07-23 23:29:57,771 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 32 [2018-07-23 23:29:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:29:57,771 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-07-23 23:29:57,771 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:29:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-07-23 23:29:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 23:29:57,772 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:29:57,772 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:29:57,772 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:29:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1065119453, now seen corresponding path program 3 times [2018-07-23 23:29:57,772 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:29:57,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:29:57,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:57,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:29:57,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:29:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:29:58,243 WARN L169 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-07-23 23:29:58,431 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-07-23 23:29:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:58,774 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:29:58,774 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:58,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:29:58,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 23:29:58,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:29:58,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:29:58,836 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 13 [2018-07-23 23:29:58,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-07-23 23:29:58,869 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:58,870 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 20 [2018-07-23 23:29:58,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,877 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,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2018-07-23 23:29:58,933 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:58,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, 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:58,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:29:58,973 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:58,974 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 24 [2018-07-23 23:29:58,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:29:58,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:29:59,008 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:29:59,012 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 21 treesize of output 24 [2018-07-23 23:29:59,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:29:59,017 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:59,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:29:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:29:59,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:29:59,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2018-07-23 23:29:59,118 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 23:29:59,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 23:29:59,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-07-23 23:29:59,119 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 27 states. [2018-07-23 23:30:00,576 WARN L169 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2018-07-23 23:30:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:00,826 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2018-07-23 23:30:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 23:30:00,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2018-07-23 23:30:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:00,827 INFO L225 Difference]: With dead ends: 138 [2018-07-23 23:30:00,828 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 23:30:00,829 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 23:30:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 23:30:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-07-23 23:30:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-23 23:30:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-07-23 23:30:00,845 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 32 [2018-07-23 23:30:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:00,845 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-07-23 23:30:00,845 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 23:30:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-07-23 23:30:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 23:30:00,846 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:00,846 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:00,846 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1371260077, now seen corresponding path program 9 times [2018-07-23 23:30:00,847 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:00,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:01,109 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:01,109 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:30:01,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:30:01,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-23 23:30:01,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:01,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:01,154 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 13 [2018-07-23 23:30:01,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:30:01,180 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:01,181 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 20 [2018-07-23 23:30:01,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:01,185 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,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:30:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:01,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:01,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2018-07-23 23:30:01,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 23:30:01,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 23:30:01,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:30:01,245 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 16 states. [2018-07-23 23:30:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:02,461 INFO L93 Difference]: Finished difference Result 278 states and 323 transitions. [2018-07-23 23:30:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 23:30:02,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-07-23 23:30:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:02,462 INFO L225 Difference]: With dead ends: 278 [2018-07-23 23:30:02,462 INFO L226 Difference]: Without dead ends: 264 [2018-07-23 23:30:02,463 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 23:30:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-23 23:30:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 114. [2018-07-23 23:30:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-23 23:30:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2018-07-23 23:30:02,482 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 33 [2018-07-23 23:30:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:02,483 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2018-07-23 23:30:02,483 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 23:30:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-07-23 23:30:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 23:30:02,483 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:02,483 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:02,484 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash -544762526, now seen corresponding path program 4 times [2018-07-23 23:30:02,484 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:02,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:02,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:02,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:02,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:03,399 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:30:03,399 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:03,399 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:30:03,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:30:03,420 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:30:03,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:03,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:03,455 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:03,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:03,467 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,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:30:03,579 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:30:03,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:03,600 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2018-07-23 23:30:03,600 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 23:30:03,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 23:30:03,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:30:03,601 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand 18 states. [2018-07-23 23:30:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:04,408 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2018-07-23 23:30:04,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 23:30:04,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 23:30:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:04,412 INFO L225 Difference]: With dead ends: 220 [2018-07-23 23:30:04,412 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 23:30:04,414 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 23:30:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 23:30:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 126. [2018-07-23 23:30:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-23 23:30:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2018-07-23 23:30:04,432 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 34 [2018-07-23 23:30:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2018-07-23 23:30:04,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 23:30:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-07-23 23:30:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 23:30:04,433 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:04,433 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:04,433 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash -909166686, now seen corresponding path program 5 times [2018-07-23 23:30:04,433 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:04,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:04,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:04,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:04,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:04,919 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:30:04,920 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:04,920 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:30:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:30:04,960 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-07-23 23:30:04,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:04,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:04,974 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 13 [2018-07-23 23:30:04,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:04,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:04,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-07-23 23:30:05,012 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,013 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:30:05,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,020 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,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2018-07-23 23:30:05,067 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:05,072 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:05,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:05,078 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,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-07-23 23:30:05,140 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:30:05,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:05,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2018-07-23 23:30:05,160 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:30:05,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:30:05,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:30:05,161 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 21 states. [2018-07-23 23:30:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:05,587 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2018-07-23 23:30:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 23:30:05,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-07-23 23:30:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:05,588 INFO L225 Difference]: With dead ends: 159 [2018-07-23 23:30:05,588 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 23:30:05,589 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2018-07-23 23:30:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 23:30:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 126. [2018-07-23 23:30:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-23 23:30:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2018-07-23 23:30:05,605 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 34 [2018-07-23 23:30:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:05,605 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2018-07-23 23:30:05,605 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:30:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-07-23 23:30:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 23:30:05,606 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:05,606 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:05,606 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1184692808, now seen corresponding path program 6 times [2018-07-23 23:30:05,606 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:05,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:05,993 WARN L169 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-07-23 23:30:06,197 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:30:06,197 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:06,198 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:30:06,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:30:06,221 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-07-23 23:30:06,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:06,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:06,235 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 13 [2018-07-23 23:30:06,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:06,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:06,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-07-23 23:30:06,267 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:06,268 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:30:06,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:06,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:30:06,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:30:06,332 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:30:06,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:06,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2018-07-23 23:30:06,354 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 23:30:06,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 23:30:06,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-07-23 23:30:06,355 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 19 states. [2018-07-23 23:30:07,552 WARN L169 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 14 [2018-07-23 23:30:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:07,857 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-07-23 23:30:07,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 23:30:07,858 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 23:30:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:07,859 INFO L225 Difference]: With dead ends: 237 [2018-07-23 23:30:07,860 INFO L226 Difference]: Without dead ends: 235 [2018-07-23 23:30:07,860 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 23:30:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-23 23:30:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 126. [2018-07-23 23:30:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-23 23:30:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2018-07-23 23:30:07,885 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 36 [2018-07-23 23:30:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:07,886 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2018-07-23 23:30:07,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 23:30:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-07-23 23:30:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 23:30:07,887 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:07,887 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:07,887 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1479758136, now seen corresponding path program 7 times [2018-07-23 23:30:07,887 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:07,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:07,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:07,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:07,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:08,323 WARN L169 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-07-23 23:30:08,660 WARN L169 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-07-23 23:30:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:09,078 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:09,078 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:30:09,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:09,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:09,138 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:09,140 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:09,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,154 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:09,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-07-23 23:30:09,199 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:09,199 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:09,200 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:09,204 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 46 [2018-07-23 23:30:09,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:31 [2018-07-23 23:30:09,256 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 23 treesize of output 18 [2018-07-23 23:30:09,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2018-07-23 23:30:09,295 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:09,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,307 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:09,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-07-23 23:30:09,327 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:09,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:09,332 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:09,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:30:09,461 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:30:09,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:09,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 27 [2018-07-23 23:30:09,482 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 23:30:09,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 23:30:09,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2018-07-23 23:30:09,482 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 27 states. [2018-07-23 23:30:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:10,356 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2018-07-23 23:30:10,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 23:30:10,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-07-23 23:30:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:10,357 INFO L225 Difference]: With dead ends: 176 [2018-07-23 23:30:10,358 INFO L226 Difference]: Without dead ends: 174 [2018-07-23 23:30:10,359 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=200, Invalid=1360, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 23:30:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-23 23:30:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 136. [2018-07-23 23:30:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 23:30:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2018-07-23 23:30:10,384 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 36 [2018-07-23 23:30:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2018-07-23 23:30:10,384 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 23:30:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2018-07-23 23:30:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 23:30:10,385 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:10,385 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:30:10,385 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash -919114561, now seen corresponding path program 5 times [2018-07-23 23:30:10,386 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:10,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:10,806 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:30:10,807 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:10,807 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:30:10,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:30:23,025 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-07-23 23:30:23,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:23,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:23,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-07-23 23:30:23,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,044 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:23,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:7 [2018-07-23 23:30:23,100 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:23,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-07-23 23:30:23,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:23,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:30:23,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2018-07-23 23:30:23,189 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:30:23,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:23,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-07-23 23:30:23,212 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:30:23,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:30:23,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:30:23,212 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand 21 states. [2018-07-23 23:30:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:23,891 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2018-07-23 23:30:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 23:30:23,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-07-23 23:30:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:23,892 INFO L225 Difference]: With dead ends: 212 [2018-07-23 23:30:23,892 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 23:30:23,892 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:30:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 23:30:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2018-07-23 23:30:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 23:30:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2018-07-23 23:30:23,920 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 37 [2018-07-23 23:30:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:23,920 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2018-07-23 23:30:23,920 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:30:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2018-07-23 23:30:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 23:30:23,921 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:23,921 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:23,921 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 273570728, now seen corresponding path program 10 times [2018-07-23 23:30:23,921 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:23,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:24,364 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:24,364 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:30:24,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:30:24,413 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:30:24,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:24,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:24,552 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:24,554 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:24,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,564 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:24,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:30:24,597 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:24,598 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:24,598 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:24,602 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:30:24,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,612 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:24,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:30:24,664 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:24,665 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:24,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-07-23 23:30:24,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,678 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:24,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-07-23 23:30:24,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-07-23 23:30:24,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:30:24,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-07-23 23:30:24,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2018-07-23 23:30:24,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-07-23 23:30:24,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:24,868 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:24,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:30:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:24,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:24,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 26 [2018-07-23 23:30:24,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:30:24,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:30:24,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:30:24,932 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 26 states. [2018-07-23 23:30:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:26,621 INFO L93 Difference]: Finished difference Result 382 states and 443 transitions. [2018-07-23 23:30:26,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 23:30:26,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-07-23 23:30:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:26,623 INFO L225 Difference]: With dead ends: 382 [2018-07-23 23:30:26,623 INFO L226 Difference]: Without dead ends: 380 [2018-07-23 23:30:26,626 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=621, Invalid=2919, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 23:30:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-23 23:30:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 187. [2018-07-23 23:30:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 23:30:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2018-07-23 23:30:26,662 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 37 [2018-07-23 23:30:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:26,662 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2018-07-23 23:30:26,662 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:30:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2018-07-23 23:30:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 23:30:26,663 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:26,663 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:26,663 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1010816808, now seen corresponding path program 11 times [2018-07-23 23:30:26,663 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:26,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:26,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:27,059 WARN L169 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-07-23 23:30:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:27,472 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:27,472 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:27,479 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:30:27,497 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 23:30:27,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:27,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:27,600 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:27,601 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:27,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:27,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:27,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:30:27,674 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:27,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:27,679 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:27,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:30:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:27,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:27,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2018-07-23 23:30:27,739 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:30:27,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:30:27,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:30:27,740 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand 24 states. [2018-07-23 23:30:28,627 WARN L169 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-07-23 23:30:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:29,777 INFO L93 Difference]: Finished difference Result 375 states and 439 transitions. [2018-07-23 23:30:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 23:30:29,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-07-23 23:30:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:29,778 INFO L225 Difference]: With dead ends: 375 [2018-07-23 23:30:29,779 INFO L226 Difference]: Without dead ends: 373 [2018-07-23 23:30:29,780 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=396, Invalid=2466, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 23:30:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-07-23 23:30:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 195. [2018-07-23 23:30:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-23 23:30:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 240 transitions. [2018-07-23 23:30:29,821 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 240 transitions. Word has length 37 [2018-07-23 23:30:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:29,821 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 240 transitions. [2018-07-23 23:30:29,821 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:30:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 240 transitions. [2018-07-23 23:30:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 23:30:29,822 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:29,822 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:29,822 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash 852367144, now seen corresponding path program 12 times [2018-07-23 23:30:29,822 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:29,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:29,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:30,225 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:30,226 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:30,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:30:30,254 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-23 23:30:30,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:30,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:30,375 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,399 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:30,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:30,469 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:30,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:30:30,514 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,514 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,517 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:30,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:30,528 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:30,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-07-23 23:30:30,533 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,535 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,536 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 43 [2018-07-23 23:30:30,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:30,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:30:30,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-07-23 23:30:30,597 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,597 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,598 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,600 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,601 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,602 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,615 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:30,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 82 [2018-07-23 23:30:30,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-07-23 23:30:30,725 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 2 xjuncts. [2018-07-23 23:30:30,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:28 [2018-07-23 23:30:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:30,791 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:30,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2018-07-23 23:30:30,791 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:30:30,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:30:30,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:30:30,792 INFO L87 Difference]: Start difference. First operand 195 states and 240 transitions. Second operand 24 states. [2018-07-23 23:30:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:31,629 INFO L93 Difference]: Finished difference Result 283 states and 338 transitions. [2018-07-23 23:30:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 23:30:31,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-07-23 23:30:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:31,631 INFO L225 Difference]: With dead ends: 283 [2018-07-23 23:30:31,631 INFO L226 Difference]: Without dead ends: 281 [2018-07-23 23:30:31,632 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 23:30:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-23 23:30:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2018-07-23 23:30:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 23:30:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2018-07-23 23:30:31,665 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 37 [2018-07-23 23:30:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:31,665 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2018-07-23 23:30:31,666 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:30:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2018-07-23 23:30:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 23:30:31,666 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:31,666 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:31,667 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1951988968, now seen corresponding path program 13 times [2018-07-23 23:30:31,667 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:31,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:31,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:32,428 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:32,428 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:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:32,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:32,458 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,459 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 25 [2018-07-23 23:30:32,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:30 [2018-07-23 23:30:32,546 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,549 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,550 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 25 treesize of output 26 [2018-07-23 23:30:32,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,612 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:32,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:30:32,644 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,645 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,645 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,647 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,650 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:30:32,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,661 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:32,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:30:32,720 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,720 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,721 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,724 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 31 [2018-07-23 23:30:32,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,755 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:32,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:30:32,799 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-07-23 23:30:32,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:30:32,845 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:32,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-07-23 23:30:32,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:32,853 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:32,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-07-23 23:30:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:32,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:32,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2018-07-23 23:30:32,903 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:30:32,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:30:32,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:30:32,903 INFO L87 Difference]: Start difference. First operand 189 states and 232 transitions. Second operand 24 states. [2018-07-23 23:30:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:34,421 INFO L93 Difference]: Finished difference Result 350 states and 410 transitions. [2018-07-23 23:30:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 23:30:34,421 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-07-23 23:30:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:34,423 INFO L225 Difference]: With dead ends: 350 [2018-07-23 23:30:34,423 INFO L226 Difference]: Without dead ends: 348 [2018-07-23 23:30:34,424 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=481, Invalid=2171, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 23:30:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-07-23 23:30:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 193. [2018-07-23 23:30:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 23:30:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2018-07-23 23:30:34,469 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 37 [2018-07-23 23:30:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:34,470 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2018-07-23 23:30:34,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:30:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2018-07-23 23:30:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 23:30:34,470 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:34,471 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:34,471 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1038925230, now seen corresponding path program 8 times [2018-07-23 23:30:34,471 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:35,087 WARN L169 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-07-23 23:30:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:35,544 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:35,544 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:35,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:30:35,566 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:30:35,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:35,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:35,628 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:35,629 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:35,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,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:35,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-07-23 23:30:35,656 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:35,658 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:35,663 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:30:35,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,672 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:35,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:30:35,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-07-23 23:30:35,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:30:35,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-07-23 23:30:35,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2018-07-23 23:30:35,791 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 23 treesize of output 18 [2018-07-23 23:30:35,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:30:35,827 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:35,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:35,834 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:35,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:30:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:35,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:35,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 29 [2018-07-23 23:30:35,986 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 23:30:35,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 23:30:35,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2018-07-23 23:30:35,986 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand 29 states. [2018-07-23 23:30:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:37,540 INFO L93 Difference]: Finished difference Result 299 states and 350 transitions. [2018-07-23 23:30:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 23:30:37,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-07-23 23:30:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:37,542 INFO L225 Difference]: With dead ends: 299 [2018-07-23 23:30:37,542 INFO L226 Difference]: Without dead ends: 297 [2018-07-23 23:30:37,543 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=314, Invalid=2766, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 23:30:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-23 23:30:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 203. [2018-07-23 23:30:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 23:30:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2018-07-23 23:30:37,589 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 38 [2018-07-23 23:30:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:37,589 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2018-07-23 23:30:37,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 23:30:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2018-07-23 23:30:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 23:30:37,590 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:37,590 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:37,590 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash -333789522, now seen corresponding path program 9 times [2018-07-23 23:30:37,590 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:37,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:37,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:37,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:37,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:38,278 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:38,279 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:38,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:30:38,322 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-07-23 23:30:38,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:38,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:38,331 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,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 20 treesize of output 27 [2018-07-23 23:30:38,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:30:38,383 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,384 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,384 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 25 treesize of output 26 [2018-07-23 23:30:38,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,394 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:38,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-07-23 23:30:38,430 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,431 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,432 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,433 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:38,434 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,435 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,436 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 24 treesize of output 72 [2018-07-23 23:30:38,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:35 [2018-07-23 23:30:38,485 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,486 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,486 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:38,487 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-07-23 23:30:38,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-07-23 23:30:38,540 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,541 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,541 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:38,542 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-07-23 23:30:38,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,554 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:38,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:13 [2018-07-23 23:30:38,617 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:38,621 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:30:38,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:38,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-07-23 23:30:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:38,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:38,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2018-07-23 23:30:38,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 23:30:38,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 23:30:38,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-07-23 23:30:38,733 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand 29 states. [2018-07-23 23:30:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:39,654 INFO L93 Difference]: Finished difference Result 233 states and 282 transitions. [2018-07-23 23:30:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 23:30:39,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-07-23 23:30:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:39,655 INFO L225 Difference]: With dead ends: 233 [2018-07-23 23:30:39,656 INFO L226 Difference]: Without dead ends: 231 [2018-07-23 23:30:39,657 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 23:30:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-23 23:30:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2018-07-23 23:30:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 23:30:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2018-07-23 23:30:39,711 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 38 [2018-07-23 23:30:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:39,712 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2018-07-23 23:30:39,712 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 23:30:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2018-07-23 23:30:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 23:30:39,713 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:39,713 INFO L353 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:39,713 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash -908333246, now seen corresponding path program 14 times [2018-07-23 23:30:39,714 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:39,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:39,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:40,128 WARN L169 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-07-23 23:30:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:40,402 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:40,402 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:40,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:30:40,440 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:30:40,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:40,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:40,462 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:40,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:40,466 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:40,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:30:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:40,520 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:40,520 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-07-23 23:30:40,520 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 23:30:40,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 23:30:40,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-07-23 23:30:40,521 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand 16 states. [2018-07-23 23:30:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:42,345 INFO L93 Difference]: Finished difference Result 517 states and 600 transitions. [2018-07-23 23:30:42,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 23:30:42,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-07-23 23:30:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:42,348 INFO L225 Difference]: With dead ends: 517 [2018-07-23 23:30:42,348 INFO L226 Difference]: Without dead ends: 515 [2018-07-23 23:30:42,349 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=463, Invalid=4507, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 23:30:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-23 23:30:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 208. [2018-07-23 23:30:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-23 23:30:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2018-07-23 23:30:42,396 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 39 [2018-07-23 23:30:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:42,396 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2018-07-23 23:30:42,396 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 23:30:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2018-07-23 23:30:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 23:30:42,397 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:42,397 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:42,397 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942183, now seen corresponding path program 10 times [2018-07-23 23:30:42,397 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:42,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:42,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:42,822 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:30:42,822 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:42,822 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:42,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:30:42,842 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:30:42,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:42,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:42,863 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 13 [2018-07-23 23:30:42,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:42,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:42,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-07-23 23:30:42,897 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:42,898 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 20 [2018-07-23 23:30:42,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:42,904 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:42,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:30:43,051 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:30:43,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:43,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-07-23 23:30:43,072 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 23:30:43,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 23:30:43,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-07-23 23:30:43,072 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand 23 states. [2018-07-23 23:30:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:43,648 INFO L93 Difference]: Finished difference Result 260 states and 319 transitions. [2018-07-23 23:30:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 23:30:43,649 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-07-23 23:30:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:43,650 INFO L225 Difference]: With dead ends: 260 [2018-07-23 23:30:43,650 INFO L226 Difference]: Without dead ends: 258 [2018-07-23 23:30:43,650 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:30:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-07-23 23:30:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 200. [2018-07-23 23:30:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 23:30:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 255 transitions. [2018-07-23 23:30:43,695 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 255 transitions. Word has length 39 [2018-07-23 23:30:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:43,695 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 255 transitions. [2018-07-23 23:30:43,695 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 23:30:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2018-07-23 23:30:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 23:30:43,696 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:43,696 INFO L353 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:43,696 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash 786989186, now seen corresponding path program 15 times [2018-07-23 23:30:43,696 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:43,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:43,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:44,086 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:44,086 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:44,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:30:44,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-07-23 23:30:44,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:44,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:44,186 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:44,187 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 20 treesize of output 27 [2018-07-23 23:30:44,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:44,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:44,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:30:44,224 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:44,225 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:44,225 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 34 [2018-07-23 23:30:44,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:44,235 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:44,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-07-23 23:30:44,328 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:44,350 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:44,374 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:44,406 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-07-23 23:30:44,407 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:30:44,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:44,572 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:44,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:30:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:44,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:44,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2018-07-23 23:30:44,794 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 23:30:44,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 23:30:44,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-07-23 23:30:44,795 INFO L87 Difference]: Start difference. First operand 200 states and 255 transitions. Second operand 23 states. [2018-07-23 23:30:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:45,747 INFO L93 Difference]: Finished difference Result 333 states and 397 transitions. [2018-07-23 23:30:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 23:30:45,747 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-07-23 23:30:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:45,748 INFO L225 Difference]: With dead ends: 333 [2018-07-23 23:30:45,748 INFO L226 Difference]: Without dead ends: 331 [2018-07-23 23:30:45,749 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 23:30:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-23 23:30:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 196. [2018-07-23 23:30:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-23 23:30:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 249 transitions. [2018-07-23 23:30:45,791 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 249 transitions. Word has length 39 [2018-07-23 23:30:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:45,792 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 249 transitions. [2018-07-23 23:30:45,792 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 23:30:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2018-07-23 23:30:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:30:45,793 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:45,793 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:45,793 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1802288493, now seen corresponding path program 11 times [2018-07-23 23:30:45,793 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:45,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:45,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:45,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:45,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:46,119 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:46,119 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:46,119 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:46,126 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:30:46,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-07-23 23:30:46,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:46,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:46,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-07-23 23:30:46,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:46,184 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:46,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-07-23 23:30:46,248 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:46,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:46,257 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:46,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-07-23 23:30:46,289 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:46,291 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:46,295 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 21 [2018-07-23 23:30:46,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:46,302 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:46,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-07-23 23:30:46,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-07-23 23:30:46,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:46,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:46,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:30:46,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-07-23 23:30:46,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:46,365 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:46,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:30:46,496 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:46,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:46,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 27 [2018-07-23 23:30:46,516 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 23:30:46,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 23:30:46,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-07-23 23:30:46,517 INFO L87 Difference]: Start difference. First operand 196 states and 249 transitions. Second operand 27 states. [2018-07-23 23:30:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:47,912 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2018-07-23 23:30:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 23:30:47,912 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-07-23 23:30:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:47,913 INFO L225 Difference]: With dead ends: 304 [2018-07-23 23:30:47,914 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 23:30:47,914 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=317, Invalid=2335, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 23:30:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 23:30:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 208. [2018-07-23 23:30:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-23 23:30:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2018-07-23 23:30:47,968 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 40 [2018-07-23 23:30:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:47,968 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2018-07-23 23:30:47,969 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 23:30:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2018-07-23 23:30:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:30:47,969 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:47,970 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:47,970 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1437884333, now seen corresponding path program 12 times [2018-07-23 23:30:47,970 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:47,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:47,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:48,353 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:48,354 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:48,354 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:48,361 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:30:48,386 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-23 23:30:48,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:48,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:48,472 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:48,473 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:48,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:48,482 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:48,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:30:48,528 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:48,529 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:48,532 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:48,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:48,541 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:48,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-07-23 23:30:48,670 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:48,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:48,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 26 [2018-07-23 23:30:48,690 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:30:48,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:30:48,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:30:48,691 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand 26 states. [2018-07-23 23:30:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:50,028 INFO L93 Difference]: Finished difference Result 343 states and 420 transitions. [2018-07-23 23:30:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 23:30:50,028 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2018-07-23 23:30:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:50,031 INFO L225 Difference]: With dead ends: 343 [2018-07-23 23:30:50,031 INFO L226 Difference]: Without dead ends: 341 [2018-07-23 23:30:50,031 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=1991, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 23:30:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-23 23:30:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 240. [2018-07-23 23:30:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-07-23 23:30:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2018-07-23 23:30:50,082 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 40 [2018-07-23 23:30:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2018-07-23 23:30:50,082 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:30:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2018-07-23 23:30:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:30:50,083 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:50,083 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:50,083 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:50,083 INFO L82 PathProgramCache]: Analyzing trace with hash 432624109, now seen corresponding path program 13 times [2018-07-23 23:30:50,083 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:50,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:50,702 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:50,703 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:50,703 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:50,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:50,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:50,780 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 13 [2018-07-23 23:30:50,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:50,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:50,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-07-23 23:30:50,860 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:50,861 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:50,869 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 2 case distinctions, treesize of input 21 treesize of output 37 [2018-07-23 23:30:50,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-07-23 23:30:50,901 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 2 xjuncts. [2018-07-23 23:30:50,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:35 [2018-07-23 23:30:51,015 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,016 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,017 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,019 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 17 treesize of output 32 [2018-07-23 23:30:51,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:51,047 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,048 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,049 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,050 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,051 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,052 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-07-23 23:30:51,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:51,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-23 23:30:51,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:35 [2018-07-23 23:30:51,185 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,186 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,187 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,190 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 19 treesize of output 38 [2018-07-23 23:30:51,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:51,219 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,220 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,221 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,221 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,223 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,224 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:51,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 72 [2018-07-23 23:30:51,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:51,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-23 23:30:51,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:51, output treesize:28 [2018-07-23 23:30:51,587 WARN L169 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-07-23 23:30:51,731 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:51,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:51,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2018-07-23 23:30:51,752 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 23:30:51,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 23:30:51,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-07-23 23:30:51,752 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand 30 states. [2018-07-23 23:30:52,697 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2018-07-23 23:30:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:54,001 INFO L93 Difference]: Finished difference Result 327 states and 403 transitions. [2018-07-23 23:30:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 23:30:54,002 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-07-23 23:30:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:54,004 INFO L225 Difference]: With dead ends: 327 [2018-07-23 23:30:54,004 INFO L226 Difference]: Without dead ends: 325 [2018-07-23 23:30:54,004 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=454, Invalid=2516, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 23:30:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-23 23:30:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 232. [2018-07-23 23:30:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 23:30:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 298 transitions. [2018-07-23 23:30:54,056 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 298 transitions. Word has length 40 [2018-07-23 23:30:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:54,057 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 298 transitions. [2018-07-23 23:30:54,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 23:30:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 298 transitions. [2018-07-23 23:30:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:30:54,058 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:54,058 INFO L353 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:54,058 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1684943316, now seen corresponding path program 14 times [2018-07-23 23:30:54,058 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:54,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:54,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:30:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:54,648 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:54,648 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:30:54,672 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:30:54,672 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:54,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:54,681 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,682 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 20 treesize of output 27 [2018-07-23 23:30:54,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:54,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:54,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2018-07-23 23:30:54,778 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,779 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,780 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,781 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,782 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,784 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 32 treesize of output 53 [2018-07-23 23:30:54,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:54,807 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:30:54,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-07-23 23:30:54,923 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,923 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:54,924 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,925 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,926 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,927 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,928 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,930 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,931 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 103 [2018-07-23 23:30:54,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:54,963 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:54,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:36 [2018-07-23 23:30:54,997 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,998 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,999 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:54,999 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,000 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,001 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,003 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,005 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 99 [2018-07-23 23:30:55,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:55,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:55,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:38 [2018-07-23 23:30:55,068 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,069 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,070 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,071 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,071 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,072 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,074 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,077 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 105 [2018-07-23 23:30:55,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:55,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:55,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-07-23 23:30:55,143 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,144 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,146 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,147 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,148 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,149 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,152 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,157 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:55,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-07-23 23:30:55,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:55,187 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:30:55,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:33 [2018-07-23 23:30:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:55,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:55,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-07-23 23:30:55,456 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 23:30:55,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 23:30:55,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:30:55,457 INFO L87 Difference]: Start difference. First operand 232 states and 298 transitions. Second operand 33 states. [2018-07-23 23:30:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:57,143 INFO L93 Difference]: Finished difference Result 344 states and 417 transitions. [2018-07-23 23:30:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 23:30:57,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-07-23 23:30:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:57,145 INFO L225 Difference]: With dead ends: 344 [2018-07-23 23:30:57,145 INFO L226 Difference]: Without dead ends: 342 [2018-07-23 23:30:57,146 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=323, Invalid=2869, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 23:30:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-23 23:30:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 230. [2018-07-23 23:30:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-23 23:30:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 295 transitions. [2018-07-23 23:30:57,208 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 295 transitions. Word has length 40 [2018-07-23 23:30:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 295 transitions. [2018-07-23 23:30:57,209 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 23:30:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 295 transitions. [2018-07-23 23:30:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 23:30:57,210 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:57,210 INFO L353 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:57,210 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1491831788, now seen corresponding path program 15 times [2018-07-23 23:30:57,210 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:57,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:57,560 WARN L169 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-07-23 23:30:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:57,856 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:57,856 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:57,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:30:57,886 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-23 23:30:57,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:57,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:57,922 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:57,922 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 20 treesize of output 27 [2018-07-23 23:30:57,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:57,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:57,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2018-07-23 23:30:57,991 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:57,994 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 25 treesize of output 26 [2018-07-23 23:30:57,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,015 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:58,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:30:58,036 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,038 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,040 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,042 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,045 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 20 treesize of output 51 [2018-07-23 23:30:58,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,065 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:58,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:17 [2018-07-23 23:30:58,122 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-07-23 23:30:58,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:30:58,169 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-07-23 23:30:58,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:30:58,205 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,206 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,206 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:58,207 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,208 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:30:58,216 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-07-23 23:30:58,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2018-07-23 23:30:58,259 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:58,263 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:58,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:58,270 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:58,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-07-23 23:30:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:58,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:30:58,357 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 25 [2018-07-23 23:30:58,357 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 23:30:58,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 23:30:58,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-07-23 23:30:58,358 INFO L87 Difference]: Start difference. First operand 230 states and 295 transitions. Second operand 25 states. [2018-07-23 23:30:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:30:59,593 INFO L93 Difference]: Finished difference Result 346 states and 417 transitions. [2018-07-23 23:30:59,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 23:30:59,594 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-07-23 23:30:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:30:59,596 INFO L225 Difference]: With dead ends: 346 [2018-07-23 23:30:59,596 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 23:30:59,597 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 23:30:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 23:30:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 230. [2018-07-23 23:30:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-23 23:30:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 295 transitions. [2018-07-23 23:30:59,646 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 295 transitions. Word has length 40 [2018-07-23 23:30:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:30:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 295 transitions. [2018-07-23 23:30:59,647 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 23:30:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 295 transitions. [2018-07-23 23:30:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 23:30:59,647 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:30:59,647 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:30:59,647 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:30:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1448281180, now seen corresponding path program 16 times [2018-07-23 23:30:59,648 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:30:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:30:59,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:59,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:30:59,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:30:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:30:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:30:59,901 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:30:59,901 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:30:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:30:59,925 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:30:59,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:30:59,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:30:59,990 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:30:59,990 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 20 treesize of output 27 [2018-07-23 23:30:59,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:30:59,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:00,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-07-23 23:31:00,026 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:00,026 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:00,027 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:31:00,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:00,038 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:31:00,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-07-23 23:31:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:00,105 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:00,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 22 [2018-07-23 23:31:00,105 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 23:31:00,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 23:31:00,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-07-23 23:31:00,105 INFO L87 Difference]: Start difference. First operand 230 states and 295 transitions. Second operand 22 states. [2018-07-23 23:31:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:02,272 INFO L93 Difference]: Finished difference Result 593 states and 688 transitions. [2018-07-23 23:31:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 23:31:02,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-07-23 23:31:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:02,274 INFO L225 Difference]: With dead ends: 593 [2018-07-23 23:31:02,274 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 23:31:02,275 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=621, Invalid=4635, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 23:31:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 23:31:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 234. [2018-07-23 23:31:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-23 23:31:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 300 transitions. [2018-07-23 23:31:02,328 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 300 transitions. Word has length 41 [2018-07-23 23:31:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:02,328 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 300 transitions. [2018-07-23 23:31:02,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 23:31:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 300 transitions. [2018-07-23 23:31:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 23:31:02,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:02,329 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:02,329 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1492922125, now seen corresponding path program 16 times [2018-07-23 23:31:02,330 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:02,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:02,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:02,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:02,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:03,335 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:03,335 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:03,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:31:03,357 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:31:03,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:03,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:03,416 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,417 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:31:03,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:03,425 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:31:03,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:31:03,485 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,486 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,486 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-07-23 23:31:03,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:03,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:03,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:31:03,527 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,528 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,529 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,534 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 35 treesize of output 50 [2018-07-23 23:31:03,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:03,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:03,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2018-07-23 23:31:03,579 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,580 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,580 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:03,586 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 31 treesize of output 46 [2018-07-23 23:31:03,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:03,598 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:31:03,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2018-07-23 23:31:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:03,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:03,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2018-07-23 23:31:03,727 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:31:03,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:31:03,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:31:03,727 INFO L87 Difference]: Start difference. First operand 234 states and 300 transitions. Second operand 26 states. [2018-07-23 23:31:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:04,815 INFO L93 Difference]: Finished difference Result 310 states and 382 transitions. [2018-07-23 23:31:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 23:31:04,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-07-23 23:31:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:04,817 INFO L225 Difference]: With dead ends: 310 [2018-07-23 23:31:04,817 INFO L226 Difference]: Without dead ends: 308 [2018-07-23 23:31:04,818 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=186, Invalid=1620, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 23:31:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-07-23 23:31:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 244. [2018-07-23 23:31:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-07-23 23:31:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 313 transitions. [2018-07-23 23:31:04,873 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 313 transitions. Word has length 41 [2018-07-23 23:31:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:04,873 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 313 transitions. [2018-07-23 23:31:04,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:31:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 313 transitions. [2018-07-23 23:31:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:31:04,874 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:04,874 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:31:04,874 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash 137449692, now seen corresponding path program 6 times [2018-07-23 23:31:04,875 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:04,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:05,039 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:31:05,040 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:05,040 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:05,047 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:31:05,082 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-07-23 23:31:05,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:05,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:05,171 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:31:05,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:05,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-07-23 23:31:05,192 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 23:31:05,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 23:31:05,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-23 23:31:05,192 INFO L87 Difference]: Start difference. First operand 244 states and 313 transitions. Second operand 15 states. [2018-07-23 23:31:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:05,518 INFO L93 Difference]: Finished difference Result 304 states and 373 transitions. [2018-07-23 23:31:05,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 23:31:05,518 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-07-23 23:31:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:05,520 INFO L225 Difference]: With dead ends: 304 [2018-07-23 23:31:05,520 INFO L226 Difference]: Without dead ends: 279 [2018-07-23 23:31:05,521 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:31:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-23 23:31:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 261. [2018-07-23 23:31:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-23 23:31:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 324 transitions. [2018-07-23 23:31:05,612 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 324 transitions. Word has length 42 [2018-07-23 23:31:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:05,613 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 324 transitions. [2018-07-23 23:31:05,613 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 23:31:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2018-07-23 23:31:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:31:05,614 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:05,614 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:05,614 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1842891667, now seen corresponding path program 17 times [2018-07-23 23:31:05,614 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:05,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:05,851 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:05,851 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:05,858 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:31:05,883 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-07-23 23:31:05,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:05,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:05,920 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:31:05,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:05,923 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:31:05,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:31:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:06,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:06,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2018-07-23 23:31:06,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 23:31:06,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 23:31:06,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-07-23 23:31:06,056 INFO L87 Difference]: Start difference. First operand 261 states and 324 transitions. Second operand 20 states. [2018-07-23 23:31:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:07,592 INFO L93 Difference]: Finished difference Result 477 states and 567 transitions. [2018-07-23 23:31:07,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 23:31:07,592 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-07-23 23:31:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:07,595 INFO L225 Difference]: With dead ends: 477 [2018-07-23 23:31:07,595 INFO L226 Difference]: Without dead ends: 475 [2018-07-23 23:31:07,596 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=3640, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 23:31:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-07-23 23:31:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 269. [2018-07-23 23:31:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-23 23:31:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 334 transitions. [2018-07-23 23:31:07,670 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 334 transitions. Word has length 42 [2018-07-23 23:31:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:07,670 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 334 transitions. [2018-07-23 23:31:07,671 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 23:31:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 334 transitions. [2018-07-23 23:31:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:31:07,671 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:07,671 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:07,671 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -821559277, now seen corresponding path program 18 times [2018-07-23 23:31:07,672 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:07,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:07,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:07,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:08,016 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:08,016 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:08,028 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:31:08,062 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-23 23:31:08,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:08,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:08,177 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:08,178 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 20 treesize of output 27 [2018-07-23 23:31:08,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:08,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:08,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:31:08,272 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:08,275 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:08,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, 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:31:08,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:08,286 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:31:08,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-07-23 23:31:08,432 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:08,433 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:08,434 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:08,436 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:31:08,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:08,446 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:31:08,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:31:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:08,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:08,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 26 [2018-07-23 23:31:08,538 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:31:08,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:31:08,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:31:08,538 INFO L87 Difference]: Start difference. First operand 269 states and 334 transitions. Second operand 26 states. [2018-07-23 23:31:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:09,768 INFO L93 Difference]: Finished difference Result 376 states and 449 transitions. [2018-07-23 23:31:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 23:31:09,768 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-07-23 23:31:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:09,770 INFO L225 Difference]: With dead ends: 376 [2018-07-23 23:31:09,770 INFO L226 Difference]: Without dead ends: 374 [2018-07-23 23:31:09,771 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 23:31:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-07-23 23:31:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 287. [2018-07-23 23:31:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-23 23:31:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 358 transitions. [2018-07-23 23:31:09,849 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 358 transitions. Word has length 42 [2018-07-23 23:31:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:09,849 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 358 transitions. [2018-07-23 23:31:09,849 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:31:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 358 transitions. [2018-07-23 23:31:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:31:09,850 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:09,850 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:09,850 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1514253165, now seen corresponding path program 19 times [2018-07-23 23:31:09,850 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:09,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:09,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:09,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:09,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:10,724 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:10,725 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:10,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:10,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:10,780 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,782 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:31:10,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:10,790 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:31:10,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-07-23 23:31:10,835 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:10,836 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,837 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,840 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 42 [2018-07-23 23:31:10,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:10,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:10,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:29 [2018-07-23 23:31:10,886 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,887 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,888 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:10,889 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,890 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,890 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:10,898 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 33 treesize of output 70 [2018-07-23 23:31:10,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:10,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:10,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:33 [2018-07-23 23:31:10,952 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,953 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,954 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:10,960 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 29 treesize of output 40 [2018-07-23 23:31:10,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:10,972 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:31:10,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-07-23 23:31:11,013 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:11,013 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:11,017 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 21 [2018-07-23 23:31:11,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:11,026 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:31:11,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-07-23 23:31:11,050 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:11,051 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:11,054 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:31:11,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:11,062 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:31:11,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-07-23 23:31:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:11,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:11,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-07-23 23:31:11,230 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 23:31:11,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 23:31:11,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2018-07-23 23:31:11,230 INFO L87 Difference]: Start difference. First operand 287 states and 358 transitions. Second operand 32 states. [2018-07-23 23:31:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:12,419 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2018-07-23 23:31:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 23:31:12,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-07-23 23:31:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:12,422 INFO L225 Difference]: With dead ends: 376 [2018-07-23 23:31:12,422 INFO L226 Difference]: Without dead ends: 374 [2018-07-23 23:31:12,423 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=2395, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 23:31:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-07-23 23:31:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 297. [2018-07-23 23:31:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-23 23:31:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 370 transitions. [2018-07-23 23:31:12,522 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 370 transitions. Word has length 42 [2018-07-23 23:31:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:12,522 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 370 transitions. [2018-07-23 23:31:12,522 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 23:31:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 370 transitions. [2018-07-23 23:31:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 23:31:12,523 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:12,523 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:12,523 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash -261933958, now seen corresponding path program 20 times [2018-07-23 23:31:12,523 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:12,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:12,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:12,972 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:12,972 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:31:12,996 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:31:12,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:12,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:13,053 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,053 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 20 treesize of output 27 [2018-07-23 23:31:13,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-07-23 23:31:13,095 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,097 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,098 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 34 [2018-07-23 23:31:13,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,106 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:31:13,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-07-23 23:31:13,129 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-07-23 23:31:13,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:31:13,243 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-07-23 23:31:13,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:31:13,327 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,327 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 25 treesize of output 26 [2018-07-23 23:31:13,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2018-07-23 23:31:13,524 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-07-23 23:31:13,565 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:13,622 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:31:13,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:13,708 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:31:13,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-07-23 23:31:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:14,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:14,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2018-07-23 23:31:14,050 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 23:31:14,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 23:31:14,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:31:14,051 INFO L87 Difference]: Start difference. First operand 297 states and 370 transitions. Second operand 31 states. [2018-07-23 23:31:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:15,379 INFO L93 Difference]: Finished difference Result 341 states and 413 transitions. [2018-07-23 23:31:15,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 23:31:15,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2018-07-23 23:31:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:15,382 INFO L225 Difference]: With dead ends: 341 [2018-07-23 23:31:15,382 INFO L226 Difference]: Without dead ends: 339 [2018-07-23 23:31:15,382 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=1845, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 23:31:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-23 23:31:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 280. [2018-07-23 23:31:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-07-23 23:31:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 350 transitions. [2018-07-23 23:31:15,475 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 350 transitions. Word has length 42 [2018-07-23 23:31:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:15,475 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 350 transitions. [2018-07-23 23:31:15,475 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 23:31:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 350 transitions. [2018-07-23 23:31:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 23:31:15,476 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:15,476 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:31:15,476 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1989786412, now seen corresponding path program 7 times [2018-07-23 23:31:15,476 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:15,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:15,792 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:31:15,792 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:15,793 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:15,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:15,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:15,836 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:15,837 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:31:15,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:15,847 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:31:15,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-07-23 23:31:15,872 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:31:15,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:15,875 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:31:15,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:31:16,012 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:31:16,031 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:16,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-07-23 23:31:16,032 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 23:31:16,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 23:31:16,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-07-23 23:31:16,032 INFO L87 Difference]: Start difference. First operand 280 states and 350 transitions. Second operand 23 states. [2018-07-23 23:31:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:16,869 INFO L93 Difference]: Finished difference Result 386 states and 472 transitions. [2018-07-23 23:31:16,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 23:31:16,869 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-07-23 23:31:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:16,871 INFO L225 Difference]: With dead ends: 386 [2018-07-23 23:31:16,871 INFO L226 Difference]: Without dead ends: 384 [2018-07-23 23:31:16,871 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 23:31:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-07-23 23:31:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 330. [2018-07-23 23:31:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-07-23 23:31:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 408 transitions. [2018-07-23 23:31:16,989 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 408 transitions. Word has length 43 [2018-07-23 23:31:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:16,989 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 408 transitions. [2018-07-23 23:31:16,989 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 23:31:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 408 transitions. [2018-07-23 23:31:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 23:31:16,990 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:16,990 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:16,990 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1716575475, now seen corresponding path program 21 times [2018-07-23 23:31:16,990 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:16,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:16,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:16,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:16,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:17,416 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:17,416 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:17,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:31:17,456 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-23 23:31:17,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:17,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:17,466 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,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 20 treesize of output 27 [2018-07-23 23:31:17,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2018-07-23 23:31:17,535 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,536 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,537 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 25 treesize of output 26 [2018-07-23 23:31:17,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,547 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:31:17,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:31:17,567 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,568 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,570 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,571 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,572 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 24 treesize of output 57 [2018-07-23 23:31:17,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:36 [2018-07-23 23:31:17,625 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,626 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,627 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,628 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,629 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 35 treesize of output 56 [2018-07-23 23:31:17,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:36 [2018-07-23 23:31:17,686 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,687 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,688 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,689 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:17,693 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 31 treesize of output 48 [2018-07-23 23:31:17,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:17,708 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:31:17,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:18 [2018-07-23 23:31:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:17,943 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:17,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2018-07-23 23:31:17,943 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 23:31:17,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 23:31:17,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:31:17,944 INFO L87 Difference]: Start difference. First operand 330 states and 408 transitions. Second operand 28 states. [2018-07-23 23:31:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:19,161 INFO L93 Difference]: Finished difference Result 374 states and 456 transitions. [2018-07-23 23:31:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 23:31:19,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 43 [2018-07-23 23:31:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:19,163 INFO L225 Difference]: With dead ends: 374 [2018-07-23 23:31:19,163 INFO L226 Difference]: Without dead ends: 358 [2018-07-23 23:31:19,164 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=1234, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 23:31:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-07-23 23:31:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2018-07-23 23:31:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-23 23:31:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2018-07-23 23:31:19,269 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 43 [2018-07-23 23:31:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:19,270 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2018-07-23 23:31:19,270 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 23:31:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2018-07-23 23:31:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 23:31:19,270 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:19,270 INFO L353 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:19,271 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2087131079, now seen corresponding path program 22 times [2018-07-23 23:31:19,271 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:19,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:19,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:19,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:19,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:19,657 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:19,657 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:19,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:31:19,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:31:19,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:19,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:19,692 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 13 [2018-07-23 23:31:19,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:19,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:19,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-07-23 23:31:19,721 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:19,722 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:31:19,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:19,727 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:31:19,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:31:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:19,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:19,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 22 [2018-07-23 23:31:19,818 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 23:31:19,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 23:31:19,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-07-23 23:31:19,818 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand 22 states. [2018-07-23 23:31:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:21,996 INFO L93 Difference]: Finished difference Result 557 states and 653 transitions. [2018-07-23 23:31:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 23:31:21,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-07-23 23:31:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:21,999 INFO L225 Difference]: With dead ends: 557 [2018-07-23 23:31:21,999 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 23:31:22,000 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=415, Invalid=4141, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 23:31:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 23:31:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 328. [2018-07-23 23:31:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-23 23:31:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2018-07-23 23:31:22,126 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 44 [2018-07-23 23:31:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:22,126 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2018-07-23 23:31:22,126 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 23:31:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2018-07-23 23:31:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 23:31:22,127 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:22,127 INFO L353 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:22,128 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1106583289, now seen corresponding path program 23 times [2018-07-23 23:31:22,128 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:22,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:22,602 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:22,602 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:22,609 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:31:22,634 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-23 23:31:22,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:22,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:22,737 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:22,760 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:31:22,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,807 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:31:22,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:31:22,820 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:22,821 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:22,821 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:22,825 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 18 treesize of output 37 [2018-07-23 23:31:22,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,837 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:31:22,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:31:22,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-07-23 23:31:22,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-07-23 23:31:22,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-07-23 23:31:22,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2018-07-23 23:31:22,954 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 23 treesize of output 18 [2018-07-23 23:31:22,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:22,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-07-23 23:31:23,003 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:31:23,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:23,011 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:31:23,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-07-23 23:31:23,083 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:23,084 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:23,087 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:31:23,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:23,097 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:31:23,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-07-23 23:31:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:23,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:23,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2018-07-23 23:31:23,276 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 23:31:23,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 23:31:23,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 23:31:23,277 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand 34 states. [2018-07-23 23:31:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:24,903 INFO L93 Difference]: Finished difference Result 415 states and 502 transitions. [2018-07-23 23:31:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 23:31:24,903 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-07-23 23:31:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:24,906 INFO L225 Difference]: With dead ends: 415 [2018-07-23 23:31:24,906 INFO L226 Difference]: Without dead ends: 413 [2018-07-23 23:31:24,907 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=349, Invalid=2303, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 23:31:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-07-23 23:31:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 342. [2018-07-23 23:31:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-07-23 23:31:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 423 transitions. [2018-07-23 23:31:25,013 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 423 transitions. Word has length 44 [2018-07-23 23:31:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:25,013 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 423 transitions. [2018-07-23 23:31:25,013 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 23:31:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 423 transitions. [2018-07-23 23:31:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 23:31:25,014 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:25,014 INFO L353 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:25,014 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 767059961, now seen corresponding path program 24 times [2018-07-23 23:31:25,015 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:25,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:25,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:25,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:25,760 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:25,760 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:25,769 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:31:25,800 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-07-23 23:31:25,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:25,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:25,889 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:25,890 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 20 treesize of output 27 [2018-07-23 23:31:25,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:25,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:25,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:31:25,932 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:25,933 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:25,933 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 25 treesize of output 26 [2018-07-23 23:31:25,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:25,943 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:31:25,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-07-23 23:31:26,048 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:26,049 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,050 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,051 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,051 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 18 treesize of output 52 [2018-07-23 23:31:26,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:26,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:26,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:29 [2018-07-23 23:31:26,101 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,101 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:26,102 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,103 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,104 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,105 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 31 treesize of output 57 [2018-07-23 23:31:26,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:26,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:26,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:29 [2018-07-23 23:31:26,153 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,154 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,155 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,155 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,158 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,159 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 79 [2018-07-23 23:31:26,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-07-23 23:31:26,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-23 23:31:26,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:38 [2018-07-23 23:31:26,282 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,283 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,283 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,284 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,287 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:31:26,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:26,300 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:31:26,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:31:26,327 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,328 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,329 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:26,331 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:31:26,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:26,341 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:31:26,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:31:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:26,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:26,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2018-07-23 23:31:26,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 23:31:26,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 23:31:26,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:31:26,445 INFO L87 Difference]: Start difference. First operand 342 states and 423 transitions. Second operand 33 states. [2018-07-23 23:31:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:27,897 INFO L93 Difference]: Finished difference Result 425 states and 516 transitions. [2018-07-23 23:31:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 23:31:27,898 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2018-07-23 23:31:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:27,900 INFO L225 Difference]: With dead ends: 425 [2018-07-23 23:31:27,900 INFO L226 Difference]: Without dead ends: 423 [2018-07-23 23:31:27,901 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=336, Invalid=2316, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 23:31:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-07-23 23:31:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 316. [2018-07-23 23:31:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-07-23 23:31:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 393 transitions. [2018-07-23 23:31:27,991 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 393 transitions. Word has length 44 [2018-07-23 23:31:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:27,991 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 393 transitions. [2018-07-23 23:31:27,991 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 23:31:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2018-07-23 23:31:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:27,992 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:27,992 INFO L353 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:27,992 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash 968168983, now seen corresponding path program 17 times [2018-07-23 23:31:27,992 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:27,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:27,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:28,496 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:28,496 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:31:28,536 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 23:31:28,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:28,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:28,565 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,568 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:31:28,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:28,580 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:31:28,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:31:28,631 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,633 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,635 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,644 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:31:28,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:28,665 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:31:28,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:31:28,759 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,761 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,763 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,771 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:31:28,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:28,789 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:31:28,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:31:28,906 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,907 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,907 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:28,911 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:31:28,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:28,921 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:31:28,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:31:28,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-07-23 23:31:28,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:28,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:28,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:31:29,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-07-23 23:31:29,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:29,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:29,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2018-07-23 23:31:29,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-07-23 23:31:29,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:29,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:29,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2018-07-23 23:31:29,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-07-23 23:31:29,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:29,105 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:31:29,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:31:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:29,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:29,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2018-07-23 23:31:29,170 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:31:29,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:31:29,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:31:29,170 INFO L87 Difference]: Start difference. First operand 316 states and 393 transitions. Second operand 26 states. [2018-07-23 23:31:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:31,202 INFO L93 Difference]: Finished difference Result 559 states and 667 transitions. [2018-07-23 23:31:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 23:31:31,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-07-23 23:31:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:31,204 INFO L225 Difference]: With dead ends: 559 [2018-07-23 23:31:31,204 INFO L226 Difference]: Without dead ends: 557 [2018-07-23 23:31:31,204 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 16 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 23:31:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-07-23 23:31:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 348. [2018-07-23 23:31:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-07-23 23:31:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 437 transitions. [2018-07-23 23:31:31,301 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 437 transitions. Word has length 45 [2018-07-23 23:31:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:31,301 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 437 transitions. [2018-07-23 23:31:31,301 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:31:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 437 transitions. [2018-07-23 23:31:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:31,302 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:31,302 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:31,302 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 733560046, now seen corresponding path program 25 times [2018-07-23 23:31:31,302 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:31,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:31,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:31,726 WARN L169 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 5 [2018-07-23 23:31:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:31,908 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:31,908 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:31,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:31,948 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:31:31,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:31,951 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:31:31,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:31:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:32,105 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:32,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 21 [2018-07-23 23:31:32,106 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 23:31:32,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 23:31:32,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-07-23 23:31:32,106 INFO L87 Difference]: Start difference. First operand 348 states and 437 transitions. Second operand 21 states. [2018-07-23 23:31:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:33,370 INFO L93 Difference]: Finished difference Result 513 states and 623 transitions. [2018-07-23 23:31:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 23:31:33,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-07-23 23:31:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:33,372 INFO L225 Difference]: With dead ends: 513 [2018-07-23 23:31:33,373 INFO L226 Difference]: Without dead ends: 511 [2018-07-23 23:31:33,373 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=356, Invalid=2724, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 23:31:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-07-23 23:31:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 374. [2018-07-23 23:31:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-07-23 23:31:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 468 transitions. [2018-07-23 23:31:33,492 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 468 transitions. Word has length 45 [2018-07-23 23:31:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:33,493 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 468 transitions. [2018-07-23 23:31:33,493 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 23:31:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 468 transitions. [2018-07-23 23:31:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:33,493 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:33,493 INFO L353 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:33,494 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:33,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1631475881, now seen corresponding path program 18 times [2018-07-23 23:31:33,494 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:33,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:33,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:33,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:34,074 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:34,074 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:34,081 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:31:34,109 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-07-23 23:31:34,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:34,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:34,233 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:34,235 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:31:34,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:34,243 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:31:34,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:31:34,292 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:34,293 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:34,298 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 20 treesize of output 27 [2018-07-23 23:31:34,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:34,304 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:31:34,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-07-23 23:31:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:34,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:34,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 26 [2018-07-23 23:31:34,364 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:31:34,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:31:34,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:31:34,364 INFO L87 Difference]: Start difference. First operand 374 states and 468 transitions. Second operand 26 states. [2018-07-23 23:31:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:35,711 INFO L93 Difference]: Finished difference Result 548 states and 660 transitions. [2018-07-23 23:31:35,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 23:31:35,711 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-07-23 23:31:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:35,713 INFO L225 Difference]: With dead ends: 548 [2018-07-23 23:31:35,713 INFO L226 Difference]: Without dead ends: 546 [2018-07-23 23:31:35,714 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 23:31:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-07-23 23:31:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 372. [2018-07-23 23:31:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-07-23 23:31:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 465 transitions. [2018-07-23 23:31:35,845 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 465 transitions. Word has length 45 [2018-07-23 23:31:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 465 transitions. [2018-07-23 23:31:35,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:31:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 465 transitions. [2018-07-23 23:31:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:35,846 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:35,846 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:35,847 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1948058286, now seen corresponding path program 26 times [2018-07-23 23:31:35,847 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:35,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:36,265 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-07-23 23:31:36,500 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 5 [2018-07-23 23:31:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:36,782 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:36,783 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:36,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:31:36,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:31:36,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:36,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:36,814 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:36,814 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 20 treesize of output 27 [2018-07-23 23:31:36,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:36,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:36,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2018-07-23 23:31:36,856 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:36,857 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:36,857 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 25 treesize of output 26 [2018-07-23 23:31:36,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:36,869 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:31:36,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:31:36,887 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:36,889 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:31:36,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:36,897 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:31:36,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-07-23 23:31:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:37,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:37,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 26 [2018-07-23 23:31:37,089 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:31:37,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:31:37,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:31:37,090 INFO L87 Difference]: Start difference. First operand 372 states and 465 transitions. Second operand 26 states. [2018-07-23 23:31:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:37,866 INFO L93 Difference]: Finished difference Result 429 states and 529 transitions. [2018-07-23 23:31:37,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 23:31:37,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-07-23 23:31:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:37,869 INFO L225 Difference]: With dead ends: 429 [2018-07-23 23:31:37,870 INFO L226 Difference]: Without dead ends: 427 [2018-07-23 23:31:37,870 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=1197, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 23:31:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-07-23 23:31:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 356. [2018-07-23 23:31:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-07-23 23:31:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 446 transitions. [2018-07-23 23:31:37,987 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 446 transitions. Word has length 45 [2018-07-23 23:31:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:37,987 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 446 transitions. [2018-07-23 23:31:37,987 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:31:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 446 transitions. [2018-07-23 23:31:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:37,988 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:37,988 INFO L353 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:37,988 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash -575427305, now seen corresponding path program 19 times [2018-07-23 23:31:37,988 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:37,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:37,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:37,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:38,413 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:38,413 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:38,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:38,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:38,538 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:38,540 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:31:38,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:38,548 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:31:38,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:31:38,652 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:38,674 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:38,685 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 21 [2018-07-23 23:31:38,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:38,693 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:31:38,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-07-23 23:31:38,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-07-23 23:31:38,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:38,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:38,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-23 23:31:38,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-07-23 23:31:38,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:38,841 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:31:38,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:31:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:38,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:38,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2018-07-23 23:31:38,979 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 23:31:38,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 23:31:38,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2018-07-23 23:31:38,980 INFO L87 Difference]: Start difference. First operand 356 states and 446 transitions. Second operand 30 states. [2018-07-23 23:31:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:42,425 INFO L93 Difference]: Finished difference Result 674 states and 798 transitions. [2018-07-23 23:31:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 23:31:42,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 45 [2018-07-23 23:31:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:42,428 INFO L225 Difference]: With dead ends: 674 [2018-07-23 23:31:42,428 INFO L226 Difference]: Without dead ends: 672 [2018-07-23 23:31:42,428 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=821, Invalid=5821, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 23:31:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-07-23 23:31:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 351. [2018-07-23 23:31:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-07-23 23:31:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 441 transitions. [2018-07-23 23:31:42,556 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 441 transitions. Word has length 45 [2018-07-23 23:31:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:42,556 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 441 transitions. [2018-07-23 23:31:42,556 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 23:31:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 441 transitions. [2018-07-23 23:31:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:42,557 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:42,557 INFO L353 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:42,557 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1899080025, now seen corresponding path program 27 times [2018-07-23 23:31:42,558 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:42,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:42,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:31:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:42,936 WARN L169 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-07-23 23:31:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:43,431 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:43,431 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:43,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:31:43,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-07-23 23:31:43,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:43,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:43,585 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,587 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:31:43,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:43,604 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:31:43,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2018-07-23 23:31:43,701 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:43,702 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,703 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,704 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,709 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 42 [2018-07-23 23:31:43,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:43,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-23 23:31:43,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-07-23 23:31:43,773 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,773 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:43,774 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,775 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,776 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,777 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:43,787 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 64 [2018-07-23 23:31:43,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:43,811 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:31:43,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:34 [2018-07-23 23:31:43,855 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,856 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,861 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,873 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 29 treesize of output 40 [2018-07-23 23:31:43,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:43,899 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:31:43,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:16 [2018-07-23 23:31:43,926 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,928 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,930 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:43,935 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 22 treesize of output 43 [2018-07-23 23:31:43,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:43,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:43,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:34 [2018-07-23 23:31:44,011 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:44,013 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:44,015 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:44,024 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 33 treesize of output 46 [2018-07-23 23:31:44,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:44,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:44,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2018-07-23 23:31:44,147 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:44,148 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:44,149 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:44,155 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 29 treesize of output 40 [2018-07-23 23:31:44,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:44,172 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:31:44,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2018-07-23 23:31:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:44,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:44,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2018-07-23 23:31:44,506 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 23:31:44,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 23:31:44,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 23:31:44,506 INFO L87 Difference]: Start difference. First operand 351 states and 441 transitions. Second operand 35 states. [2018-07-23 23:31:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:47,254 INFO L93 Difference]: Finished difference Result 425 states and 522 transitions. [2018-07-23 23:31:47,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 23:31:47,255 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-07-23 23:31:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:47,257 INFO L225 Difference]: With dead ends: 425 [2018-07-23 23:31:47,257 INFO L226 Difference]: Without dead ends: 395 [2018-07-23 23:31:47,258 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=431, Invalid=3229, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 23:31:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-07-23 23:31:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 363. [2018-07-23 23:31:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-07-23 23:31:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 456 transitions. [2018-07-23 23:31:47,386 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 456 transitions. Word has length 45 [2018-07-23 23:31:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:47,386 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 456 transitions. [2018-07-23 23:31:47,386 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 23:31:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 456 transitions. [2018-07-23 23:31:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 23:31:47,387 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:47,387 INFO L353 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:47,387 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1204129047, now seen corresponding path program 20 times [2018-07-23 23:31:47,387 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:47,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:47,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 9 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:47,837 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:47,837 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:47,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:31:47,872 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:31:47,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:47,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:47,881 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:47,881 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 20 treesize of output 27 [2018-07-23 23:31:47,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:47,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:47,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-07-23 23:31:47,937 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:47,938 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:47,939 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 25 treesize of output 26 [2018-07-23 23:31:47,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:47,951 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:31:47,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:31:47,998 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:47,999 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:47,999 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,000 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,002 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:31:48,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,016 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:31:48,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:31:48,065 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,066 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,066 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,069 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 31 [2018-07-23 23:31:48,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,080 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:31:48,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:31:48,131 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,132 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,133 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,136 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 31 [2018-07-23 23:31:48,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,148 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:31:48,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-07-23 23:31:48,194 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-07-23 23:31:48,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-07-23 23:31:48,241 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-07-23 23:31:48,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:31:48,311 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:48,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-07-23 23:31:48,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:48,331 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:31:48,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-07-23 23:31:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:48,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:48,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2018-07-23 23:31:48,395 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 23:31:48,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 23:31:48,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:31:48,395 INFO L87 Difference]: Start difference. First operand 363 states and 456 transitions. Second operand 31 states. [2018-07-23 23:31:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:51,314 INFO L93 Difference]: Finished difference Result 646 states and 777 transitions. [2018-07-23 23:31:51,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 23:31:51,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-07-23 23:31:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:51,317 INFO L225 Difference]: With dead ends: 646 [2018-07-23 23:31:51,317 INFO L226 Difference]: Without dead ends: 644 [2018-07-23 23:31:51,317 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=799, Invalid=4313, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 23:31:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-07-23 23:31:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 383. [2018-07-23 23:31:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-07-23 23:31:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 483 transitions. [2018-07-23 23:31:51,463 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 483 transitions. Word has length 45 [2018-07-23 23:31:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:51,463 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 483 transitions. [2018-07-23 23:31:51,463 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 23:31:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 483 transitions. [2018-07-23 23:31:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 23:31:51,464 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:51,464 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:51,464 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -155684552, now seen corresponding path program 28 times [2018-07-23 23:31:51,464 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:51,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:51,955 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:31:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:52,157 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:52,158 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:31:52,183 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:31:52,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:52,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:52,211 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:31:52,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:52,217 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:31:52,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-07-23 23:31:52,270 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,271 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,272 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,276 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:31:52,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:52,289 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:31:52,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-07-23 23:31:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,342 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,345 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:31:52,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:52,360 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:31:52,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-07-23 23:31:52,409 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,410 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,411 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,412 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,413 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,414 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 63 [2018-07-23 23:31:52,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:52,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:52,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-23 23:31:52,468 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,469 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,470 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,471 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,472 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,474 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:52,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 66 [2018-07-23 23:31:52,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:52,501 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:31:52,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2018-07-23 23:31:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:52,677 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:52,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2018-07-23 23:31:52,678 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 23:31:52,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 23:31:52,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2018-07-23 23:31:52,678 INFO L87 Difference]: Start difference. First operand 383 states and 483 transitions. Second operand 31 states. [2018-07-23 23:31:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:55,097 INFO L93 Difference]: Finished difference Result 540 states and 659 transitions. [2018-07-23 23:31:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 23:31:55,098 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 46 [2018-07-23 23:31:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:55,101 INFO L225 Difference]: With dead ends: 540 [2018-07-23 23:31:55,101 INFO L226 Difference]: Without dead ends: 538 [2018-07-23 23:31:55,102 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=671, Invalid=3235, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 23:31:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-07-23 23:31:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 373. [2018-07-23 23:31:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-07-23 23:31:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 471 transitions. [2018-07-23 23:31:55,250 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 471 transitions. Word has length 46 [2018-07-23 23:31:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:55,250 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 471 transitions. [2018-07-23 23:31:55,250 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 23:31:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 471 transitions. [2018-07-23 23:31:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 23:31:55,251 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:55,251 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:55,251 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash 732230495, now seen corresponding path program 29 times [2018-07-23 23:31:55,251 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:55,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:55,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:55,791 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:55,791 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:31:55,824 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 23:31:55,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:55,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:55,835 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:31:55,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:55,845 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:31:55,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-07-23 23:31:55,886 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,887 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,891 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:31:55,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:55,905 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:31:55,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-07-23 23:31:55,936 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,937 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,941 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:31:55,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:55,953 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:31:55,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-07-23 23:31:55,957 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,957 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,958 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,959 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,960 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:55,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 51 [2018-07-23 23:31:55,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:55,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:55,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-07-23 23:31:56,012 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,013 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,014 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,015 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,016 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,017 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,018 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,019 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,020 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 86 [2018-07-23 23:31:56,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-07-23 23:31:56,091 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,093 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,093 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,094 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,095 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:56,096 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,097 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:56,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 81 [2018-07-23 23:31:56,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:26 [2018-07-23 23:31:56,183 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 23 treesize of output 18 [2018-07-23 23:31:56,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:31:56,222 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:31:56,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:56,226 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:31:56,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:31:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:56,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:31:56,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 30 [2018-07-23 23:31:56,317 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 23:31:56,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 23:31:56,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-07-23 23:31:56,318 INFO L87 Difference]: Start difference. First operand 373 states and 471 transitions. Second operand 30 states. [2018-07-23 23:31:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:31:58,641 INFO L93 Difference]: Finished difference Result 508 states and 612 transitions. [2018-07-23 23:31:58,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 23:31:58,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-07-23 23:31:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:31:58,645 INFO L225 Difference]: With dead ends: 508 [2018-07-23 23:31:58,645 INFO L226 Difference]: Without dead ends: 506 [2018-07-23 23:31:58,645 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=331, Invalid=4499, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 23:31:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-07-23 23:31:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 377. [2018-07-23 23:31:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-23 23:31:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2018-07-23 23:31:58,788 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 46 [2018-07-23 23:31:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:31:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2018-07-23 23:31:58,789 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 23:31:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2018-07-23 23:31:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 23:31:58,789 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:31:58,789 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:31:58,789 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:31:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash -256090465, now seen corresponding path program 30 times [2018-07-23 23:31:58,790 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:31:58,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:31:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:58,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:31:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:31:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:31:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:31:59,584 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:31:59,584 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:31:59,591 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:31:59,615 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-07-23 23:31:59,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:31:59,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:31:59,665 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:31:59,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,672 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:31:59,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-07-23 23:31:59,709 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,710 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,712 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,713 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,714 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,715 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 57 [2018-07-23 23:31:59,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:32 [2018-07-23 23:31:59,839 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,848 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:59,852 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,853 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,853 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,854 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,855 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,855 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:59,857 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 114 [2018-07-23 23:31:59,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:32 [2018-07-23 23:31:59,938 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,939 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,940 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,940 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:31:59,941 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:31:59,949 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 33 treesize of output 61 [2018-07-23 23:31:59,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:31:59,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:34 [2018-07-23 23:32:00,006 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:00,007 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:00,014 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 23 treesize of output 30 [2018-07-23 23:32:00,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:00,026 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:32:00,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-07-23 23:32:00,112 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:00,113 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:00,114 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:00,119 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 18 treesize of output 37 [2018-07-23 23:32:00,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:00,143 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:32:00,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2018-07-23 23:32:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:00,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:00,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 30 [2018-07-23 23:32:00,244 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 23:32:00,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 23:32:00,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2018-07-23 23:32:00,244 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand 30 states. [2018-07-23 23:32:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:02,179 INFO L93 Difference]: Finished difference Result 479 states and 589 transitions. [2018-07-23 23:32:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 23:32:02,180 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-07-23 23:32:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:02,183 INFO L225 Difference]: With dead ends: 479 [2018-07-23 23:32:02,183 INFO L226 Difference]: Without dead ends: 477 [2018-07-23 23:32:02,183 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=356, Invalid=2614, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 23:32:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-07-23 23:32:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 377. [2018-07-23 23:32:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-23 23:32:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2018-07-23 23:32:02,338 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 46 [2018-07-23 23:32:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2018-07-23 23:32:02,338 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 23:32:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2018-07-23 23:32:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 23:32:02,338 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:02,339 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:02,339 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1279790881, now seen corresponding path program 31 times [2018-07-23 23:32:02,339 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:02,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:02,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:02,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:02,714 WARN L169 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-07-23 23:32:03,033 WARN L169 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2018-07-23 23:32:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:03,457 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:03,457 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:03,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:32:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:03,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:03,487 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,488 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 25 [2018-07-23 23:32:03,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:30 [2018-07-23 23:32:03,541 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,542 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,542 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 25 treesize of output 26 [2018-07-23 23:32:03,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,553 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:32:03,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:32:03,573 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,574 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,575 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,577 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 39 [2018-07-23 23:32:03,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,588 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:32:03,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-07-23 23:32:03,620 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,620 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,621 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,622 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,627 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 69 [2018-07-23 23:32:03,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:31 [2018-07-23 23:32:03,686 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,688 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,689 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,690 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,691 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,692 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,693 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,693 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:03,694 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,695 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,696 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:03,703 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 126 [2018-07-23 23:32:03,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2018-07-23 23:32:03,770 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,771 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,771 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,772 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,773 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:03,774 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 69 [2018-07-23 23:32:03,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-07-23 23:32:03,824 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,825 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,826 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,827 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,827 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:03,829 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,833 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 29 treesize of output 61 [2018-07-23 23:32:03,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,853 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:32:03,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2018-07-23 23:32:03,929 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:03,931 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:32:03,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:03,938 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:32:03,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-07-23 23:32:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:04,130 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:04,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 33 [2018-07-23 23:32:04,130 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 23:32:04,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 23:32:04,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 23:32:04,131 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand 33 states. [2018-07-23 23:32:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:05,984 INFO L93 Difference]: Finished difference Result 476 states and 586 transitions. [2018-07-23 23:32:05,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 23:32:05,984 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2018-07-23 23:32:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:05,987 INFO L225 Difference]: With dead ends: 476 [2018-07-23 23:32:05,987 INFO L226 Difference]: Without dead ends: 474 [2018-07-23 23:32:05,987 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=333, Invalid=2319, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 23:32:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-07-23 23:32:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 377. [2018-07-23 23:32:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-23 23:32:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2018-07-23 23:32:06,143 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 46 [2018-07-23 23:32:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:06,143 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2018-07-23 23:32:06,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 23:32:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2018-07-23 23:32:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 23:32:06,144 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:06,144 INFO L353 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:06,144 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash 880658929, now seen corresponding path program 21 times [2018-07-23 23:32:06,144 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:06,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:32:06,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:06,361 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:06,362 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:06,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:32:06,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-07-23 23:32:06,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:06,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:06,429 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:32:06,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:06,433 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:32:06,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-07-23 23:32:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:06,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:06,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2018-07-23 23:32:06,486 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 23:32:06,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 23:32:06,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-07-23 23:32:06,487 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand 18 states. [2018-07-23 23:32:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:09,787 INFO L93 Difference]: Finished difference Result 1001 states and 1183 transitions. [2018-07-23 23:32:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 23:32:09,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-07-23 23:32:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:09,790 INFO L225 Difference]: With dead ends: 1001 [2018-07-23 23:32:09,791 INFO L226 Difference]: Without dead ends: 999 [2018-07-23 23:32:09,791 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=663, Invalid=8457, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 23:32:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-07-23 23:32:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 417. [2018-07-23 23:32:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-07-23 23:32:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 535 transitions. [2018-07-23 23:32:09,959 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 535 transitions. Word has length 47 [2018-07-23 23:32:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:09,960 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 535 transitions. [2018-07-23 23:32:09,960 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 23:32:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2018-07-23 23:32:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 23:32:09,961 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:09,961 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:09,961 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2060544376, now seen corresponding path program 32 times [2018-07-23 23:32:09,961 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:09,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:10,259 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:10,259 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:10,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:32:10,296 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:32:10,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:10,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:10,359 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 13 [2018-07-23 23:32:10,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:10,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:10,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-07-23 23:32:10,386 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:10,386 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 20 [2018-07-23 23:32:10,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:10,392 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:32:10,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-07-23 23:32:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:10,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:10,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 24 [2018-07-23 23:32:10,572 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 23:32:10,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 23:32:10,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-07-23 23:32:10,572 INFO L87 Difference]: Start difference. First operand 417 states and 535 transitions. Second operand 24 states. [2018-07-23 23:32:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:12,474 INFO L93 Difference]: Finished difference Result 586 states and 721 transitions. [2018-07-23 23:32:12,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 23:32:12,475 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-07-23 23:32:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:12,477 INFO L225 Difference]: With dead ends: 586 [2018-07-23 23:32:12,477 INFO L226 Difference]: Without dead ends: 584 [2018-07-23 23:32:12,477 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=330, Invalid=2862, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 23:32:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-07-23 23:32:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 425. [2018-07-23 23:32:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-07-23 23:32:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 545 transitions. [2018-07-23 23:32:12,655 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 545 transitions. Word has length 47 [2018-07-23 23:32:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:12,655 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 545 transitions. [2018-07-23 23:32:12,655 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 23:32:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 545 transitions. [2018-07-23 23:32:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 23:32:12,656 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:12,656 INFO L353 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:12,656 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:12,656 INFO L82 PathProgramCache]: Analyzing trace with hash -130613007, now seen corresponding path program 22 times [2018-07-23 23:32:12,656 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:12,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:12,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:13,035 WARN L169 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-07-23 23:32:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:13,570 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:13,571 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:32:13,610 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:32:13,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:13,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:14,385 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:14,386 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 20 treesize of output 27 [2018-07-23 23:32:14,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:14,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:14,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-07-23 23:32:14,432 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:14,433 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:14,433 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 34 [2018-07-23 23:32:14,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:14,443 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:32:14,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-07-23 23:32:14,505 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:14,506 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:14,506 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:14,509 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:32:14,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:14,519 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:32:14,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:32:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:14,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:14,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 26 [2018-07-23 23:32:14,582 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 23:32:14,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 23:32:14,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-07-23 23:32:14,583 INFO L87 Difference]: Start difference. First operand 425 states and 545 transitions. Second operand 26 states. [2018-07-23 23:32:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:16,294 INFO L93 Difference]: Finished difference Result 599 states and 732 transitions. [2018-07-23 23:32:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 23:32:16,295 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-07-23 23:32:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:16,296 INFO L225 Difference]: With dead ends: 599 [2018-07-23 23:32:16,297 INFO L226 Difference]: Without dead ends: 597 [2018-07-23 23:32:16,297 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=196, Invalid=1286, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 23:32:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-23 23:32:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 421. [2018-07-23 23:32:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-07-23 23:32:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 540 transitions. [2018-07-23 23:32:16,472 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 540 transitions. Word has length 47 [2018-07-23 23:32:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:16,472 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 540 transitions. [2018-07-23 23:32:16,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 23:32:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 540 transitions. [2018-07-23 23:32:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 23:32:16,472 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:16,473 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:16,473 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1944342008, now seen corresponding path program 33 times [2018-07-23 23:32:16,473 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:16,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:16,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:16,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:16,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:16,918 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:16,918 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:16,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 23:32:16,964 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-07-23 23:32:16,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:16,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:16,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-07-23 23:32:16,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:16,982 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:32:16,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:7 [2018-07-23 23:32:17,003 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,005 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:32:17,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,015 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:32:17,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-07-23 23:32:17,026 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,028 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,031 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 22 treesize of output 43 [2018-07-23 23:32:17,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:34 [2018-07-23 23:32:17,081 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,081 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,082 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,087 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 33 treesize of output 46 [2018-07-23 23:32:17,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:34 [2018-07-23 23:32:17,135 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,136 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,137 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,144 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 29 treesize of output 40 [2018-07-23 23:32:17,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,157 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:32:17,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2018-07-23 23:32:17,229 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,230 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,231 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:17,235 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 25 [2018-07-23 23:32:17,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:17,252 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:32:17,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:19 [2018-07-23 23:32:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:17,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:17,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-07-23 23:32:17,450 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 23:32:17,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 23:32:17,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2018-07-23 23:32:17,451 INFO L87 Difference]: Start difference. First operand 421 states and 540 transitions. Second operand 30 states. [2018-07-23 23:32:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:19,355 INFO L93 Difference]: Finished difference Result 535 states and 672 transitions. [2018-07-23 23:32:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 23:32:19,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2018-07-23 23:32:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:19,357 INFO L225 Difference]: With dead ends: 535 [2018-07-23 23:32:19,358 INFO L226 Difference]: Without dead ends: 533 [2018-07-23 23:32:19,358 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 23:32:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-07-23 23:32:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 461. [2018-07-23 23:32:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-07-23 23:32:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 591 transitions. [2018-07-23 23:32:19,551 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 591 transitions. Word has length 47 [2018-07-23 23:32:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:19,551 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 591 transitions. [2018-07-23 23:32:19,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 23:32:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 591 transitions. [2018-07-23 23:32:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 23:32:19,552 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:19,552 INFO L353 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:19,552 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash -272819087, now seen corresponding path program 23 times [2018-07-23 23:32:19,552 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:19,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:19,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:20,182 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:20,182 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:20,189 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:32:20,231 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-07-23 23:32:20,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:20,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:20,362 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,363 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 20 treesize of output 27 [2018-07-23 23:32:20,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-07-23 23:32:20,409 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,410 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,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, 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 34 [2018-07-23 23:32:20,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,421 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:32:20,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-07-23 23:32:20,502 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,502 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,503 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,504 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,507 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 49 [2018-07-23 23:32:20,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,520 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:32:20,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:18 [2018-07-23 23:32:20,583 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,584 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,585 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,586 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,589 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 49 [2018-07-23 23:32:20,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,603 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:32:20,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:18 [2018-07-23 23:32:20,659 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,660 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,660 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,662 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,663 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,664 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,668 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 83 [2018-07-23 23:32:20,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-07-23 23:32:20,773 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,773 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,774 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,775 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,775 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,776 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,777 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,778 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,778 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,779 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,783 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 122 [2018-07-23 23:32:20,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2018-07-23 23:32:20,858 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,860 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,860 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,861 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,866 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:20,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 86 [2018-07-23 23:32:20,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:20,889 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:32:20,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2018-07-23 23:32:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:20,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:20,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2018-07-23 23:32:20,969 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 23:32:20,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 23:32:20,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 23:32:20,969 INFO L87 Difference]: Start difference. First operand 461 states and 591 transitions. Second operand 34 states. [2018-07-23 23:32:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:24,948 INFO L93 Difference]: Finished difference Result 883 states and 1070 transitions. [2018-07-23 23:32:24,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 23:32:24,949 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 47 [2018-07-23 23:32:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:24,952 INFO L225 Difference]: With dead ends: 883 [2018-07-23 23:32:24,952 INFO L226 Difference]: Without dead ends: 869 [2018-07-23 23:32:24,953 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2607 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1053, Invalid=6779, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 23:32:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-07-23 23:32:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 507. [2018-07-23 23:32:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-07-23 23:32:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 653 transitions. [2018-07-23 23:32:25,176 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 653 transitions. Word has length 47 [2018-07-23 23:32:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:25,176 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 653 transitions. [2018-07-23 23:32:25,177 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 23:32:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 653 transitions. [2018-07-23 23:32:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 23:32:25,178 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:25,178 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:25,178 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1432732033, now seen corresponding path program 34 times [2018-07-23 23:32:25,178 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:25,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:25,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:25,845 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:25,845 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 23:32:25,871 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 23:32:25,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:25,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:25,917 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:25,918 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:25,918 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 46 [2018-07-23 23:32:25,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:25,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:25,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-07-23 23:32:25,973 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:25,975 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:25,975 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 25 treesize of output 26 [2018-07-23 23:32:25,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:25,985 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:32:25,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-07-23 23:32:26,051 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,052 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,053 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,054 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,055 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 22 treesize of output 49 [2018-07-23 23:32:26,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:34 [2018-07-23 23:32:26,111 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,112 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,113 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,114 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,115 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,115 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:26,116 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,117 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:26,118 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,119 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 35 treesize of output 98 [2018-07-23 23:32:26,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:35 [2018-07-23 23:32:26,179 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,180 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,181 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,182 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,187 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 31 treesize of output 48 [2018-07-23 23:32:26,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,200 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:32:26,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-07-23 23:32:26,242 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,243 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,243 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,244 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,245 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 24 treesize of output 53 [2018-07-23 23:32:26,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-07-23 23:32:26,294 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,295 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,295 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,296 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,297 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 37 treesize of output 64 [2018-07-23 23:32:26,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2018-07-23 23:32:26,346 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,347 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,347 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,348 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:26,352 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 33 treesize of output 56 [2018-07-23 23:32:26,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:26,366 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:32:26,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:20 [2018-07-23 23:32:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:26,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:26,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 36 [2018-07-23 23:32:26,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 23:32:26,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 23:32:26,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 23:32:26,520 INFO L87 Difference]: Start difference. First operand 507 states and 653 transitions. Second operand 36 states. [2018-07-23 23:32:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:29,070 INFO L93 Difference]: Finished difference Result 545 states and 692 transitions. [2018-07-23 23:32:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 23:32:29,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-07-23 23:32:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:29,072 INFO L225 Difference]: With dead ends: 545 [2018-07-23 23:32:29,072 INFO L226 Difference]: Without dead ends: 515 [2018-07-23 23:32:29,073 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=3188, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 23:32:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-23 23:32:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 469. [2018-07-23 23:32:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-23 23:32:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 609 transitions. [2018-07-23 23:32:29,261 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 609 transitions. Word has length 47 [2018-07-23 23:32:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:29,261 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 609 transitions. [2018-07-23 23:32:29,261 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 23:32:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 609 transitions. [2018-07-23 23:32:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 23:32:29,262 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:29,262 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:29,262 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash -278970905, now seen corresponding path program 8 times [2018-07-23 23:32:29,262 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:29,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:29,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:29,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:29,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:29,494 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:29,495 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:29,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:32:29,518 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:32:29,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:29,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:29,579 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:29,580 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:32:29,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:29,589 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:32:29,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2018-07-23 23:32:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:29,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:29,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-07-23 23:32:29,820 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 23:32:29,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 23:32:29,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-07-23 23:32:29,820 INFO L87 Difference]: Start difference. First operand 469 states and 609 transitions. Second operand 25 states. [2018-07-23 23:32:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:31,033 INFO L93 Difference]: Finished difference Result 574 states and 726 transitions. [2018-07-23 23:32:31,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 23:32:31,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 23:32:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:31,035 INFO L225 Difference]: With dead ends: 574 [2018-07-23 23:32:31,035 INFO L226 Difference]: Without dead ends: 572 [2018-07-23 23:32:31,036 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1265, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 23:32:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-07-23 23:32:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 510. [2018-07-23 23:32:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-07-23 23:32:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 656 transitions. [2018-07-23 23:32:31,307 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 656 transitions. Word has length 48 [2018-07-23 23:32:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:31,307 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 656 transitions. [2018-07-23 23:32:31,307 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 23:32:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 656 transitions. [2018-07-23 23:32:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 23:32:31,308 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:31,308 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:31,308 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1237979874, now seen corresponding path program 35 times [2018-07-23 23:32:31,309 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:31,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:31,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:31,724 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:31,725 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:31,731 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 23:32:31,774 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-23 23:32:31,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:31,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:31,887 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:31,889 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:32:31,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:31,898 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:32:31,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-07-23 23:32:31,967 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:32:31,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:31,971 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:32:31,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2018-07-23 23:32:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:32,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:32,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 28 [2018-07-23 23:32:32,054 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 23:32:32,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 23:32:32,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:32:32,054 INFO L87 Difference]: Start difference. First operand 510 states and 656 transitions. Second operand 28 states. [2018-07-23 23:32:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:35,459 INFO L93 Difference]: Finished difference Result 829 states and 1017 transitions. [2018-07-23 23:32:35,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 23:32:35,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-07-23 23:32:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:35,463 INFO L225 Difference]: With dead ends: 829 [2018-07-23 23:32:35,463 INFO L226 Difference]: Without dead ends: 827 [2018-07-23 23:32:35,464 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=716, Invalid=5136, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 23:32:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-07-23 23:32:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 549. [2018-07-23 23:32:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-07-23 23:32:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 711 transitions. [2018-07-23 23:32:35,721 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 711 transitions. Word has length 48 [2018-07-23 23:32:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:35,721 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 711 transitions. [2018-07-23 23:32:35,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 23:32:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 711 transitions. [2018-07-23 23:32:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 23:32:35,722 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:35,722 INFO L353 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:35,722 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1167778181, now seen corresponding path program 36 times [2018-07-23 23:32:35,723 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:35,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:36,048 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-07-23 23:32:36,470 WARN L169 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-07-23 23:32:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:36,875 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:36,875 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:36,882 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-23 23:32:36,906 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-23 23:32:36,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:36,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:36,930 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:32:36,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:36,938 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:32:36,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-07-23 23:32:36,978 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:36,983 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 21 [2018-07-23 23:32:36,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:36,994 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:32:36,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-07-23 23:32:36,998 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,000 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,001 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 51 [2018-07-23 23:32:37,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-07-23 23:32:37,054 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,055 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,055 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,057 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,058 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,059 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,060 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,061 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,063 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 86 [2018-07-23 23:32:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-07-23 23:32:37,143 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,145 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,146 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,147 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,148 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,149 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:37,150 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:37,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 81 [2018-07-23 23:32:37,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:26 [2018-07-23 23:32:37,221 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 23 treesize of output 18 [2018-07-23 23:32:37,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-07-23 23:32:37,262 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:32:37,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:37,266 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:32:37,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-07-23 23:32:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:37,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:37,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 28 [2018-07-23 23:32:37,342 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 23:32:37,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 23:32:37,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-07-23 23:32:37,342 INFO L87 Difference]: Start difference. First operand 549 states and 711 transitions. Second operand 28 states. [2018-07-23 23:32:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:39,823 INFO L93 Difference]: Finished difference Result 702 states and 871 transitions. [2018-07-23 23:32:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 23:32:39,823 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-07-23 23:32:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:39,827 INFO L225 Difference]: With dead ends: 702 [2018-07-23 23:32:39,827 INFO L226 Difference]: Without dead ends: 700 [2018-07-23 23:32:39,827 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=214, Invalid=2438, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 23:32:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-07-23 23:32:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 539. [2018-07-23 23:32:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-07-23 23:32:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 698 transitions. [2018-07-23 23:32:40,091 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 698 transitions. Word has length 48 [2018-07-23 23:32:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 698 transitions. [2018-07-23 23:32:40,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 23:32:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 698 transitions. [2018-07-23 23:32:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 23:32:40,092 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:40,092 INFO L353 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:40,092 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 179457221, now seen corresponding path program 37 times [2018-07-23 23:32:40,092 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:40,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 8 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:40,727 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:40,727 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:40,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:32:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:40,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:41,008 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,009 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 20 treesize of output 27 [2018-07-23 23:32:41,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-07-23 23:32:41,057 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,058 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,058 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:32:41,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,069 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:32:41,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-07-23 23:32:41,109 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,110 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,111 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,112 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,113 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,114 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,116 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 79 [2018-07-23 23:32:41,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:33 [2018-07-23 23:32:41,177 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,178 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,179 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,179 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,180 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,181 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,184 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 86 [2018-07-23 23:32:41,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:33 [2018-07-23 23:32:41,245 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,245 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,246 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:41,246 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,247 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,248 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,248 INFO L682 Elim1Store]: detected equality via solver [2018-07-23 23:32:41,249 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,250 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 37 treesize of output 94 [2018-07-23 23:32:41,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-07-23 23:32:41,310 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,311 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,312 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,313 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,318 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 33 treesize of output 60 [2018-07-23 23:32:41,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,331 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:32:41,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:17 [2018-07-23 23:32:41,382 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,383 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,384 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:41,386 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:32:41,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:41,397 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:32:41,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2018-07-23 23:32:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:41,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:41,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2018-07-23 23:32:41,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 23:32:41,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 23:32:41,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 23:32:41,585 INFO L87 Difference]: Start difference. First operand 539 states and 698 transitions. Second operand 37 states. [2018-07-23 23:32:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:43,931 INFO L93 Difference]: Finished difference Result 661 states and 837 transitions. [2018-07-23 23:32:43,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 23:32:43,931 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-07-23 23:32:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:43,933 INFO L225 Difference]: With dead ends: 661 [2018-07-23 23:32:43,933 INFO L226 Difference]: Without dead ends: 659 [2018-07-23 23:32:43,934 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=382, Invalid=2924, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 23:32:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-07-23 23:32:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 533. [2018-07-23 23:32:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-07-23 23:32:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 693 transitions. [2018-07-23 23:32:44,190 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 693 transitions. Word has length 48 [2018-07-23 23:32:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 693 transitions. [2018-07-23 23:32:44,190 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 23:32:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 693 transitions. [2018-07-23 23:32:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 23:32:44,191 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:44,191 INFO L353 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:44,191 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash 939189189, now seen corresponding path program 38 times [2018-07-23 23:32:44,191 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:44,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:44,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 23:32:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:44,522 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-07-23 23:32:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:45,126 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:45,126 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:45,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 23:32:45,158 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 23:32:45,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 23:32:45,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 23:32:45,166 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,167 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 20 treesize of output 27 [2018-07-23 23:32:45,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-07-23 23:32:45,191 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,192 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,192 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 25 treesize of output 30 [2018-07-23 23:32:45,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,203 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:32:45,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-07-23 23:32:45,289 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,290 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,291 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,298 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,301 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 20 treesize of output 51 [2018-07-23 23:32:45,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,324 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:32:45,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-07-23 23:32:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,438 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,440 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,442 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,447 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 20 treesize of output 51 [2018-07-23 23:32:45,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,465 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:32:45,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-07-23 23:32:45,562 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,563 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,563 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,564 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,565 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,565 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,568 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 85 [2018-07-23 23:32:45,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2018-07-23 23:32:45,640 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,641 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,642 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,642 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,643 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,644 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,645 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,646 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,647 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,648 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,659 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 112 [2018-07-23 23:32:45,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2018-07-23 23:32:45,736 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,737 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,738 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,739 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,740 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,741 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,745 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-07-23 23:32:45,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2018-07-23 23:32:45,802 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,803 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,804 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,805 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,806 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 37 treesize of output 64 [2018-07-23 23:32:45,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:35 [2018-07-23 23:32:45,863 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,864 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,865 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,867 INFO L700 Elim1Store]: detected not equals via solver [2018-07-23 23:32:45,871 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 33 treesize of output 56 [2018-07-23 23:32:45,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-23 23:32:45,885 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:32:45,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:24 [2018-07-23 23:32:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:46,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-23 23:32:46,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2018-07-23 23:32:46,350 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 23:32:46,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 23:32:46,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 23:32:46,351 INFO L87 Difference]: Start difference. First operand 533 states and 693 transitions. Second operand 39 states. [2018-07-23 23:32:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 23:32:50,323 INFO L93 Difference]: Finished difference Result 694 states and 862 transitions. [2018-07-23 23:32:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 23:32:50,323 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2018-07-23 23:32:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 23:32:50,325 INFO L225 Difference]: With dead ends: 694 [2018-07-23 23:32:50,325 INFO L226 Difference]: Without dead ends: 692 [2018-07-23 23:32:50,326 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=400, Invalid=4570, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 23:32:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-07-23 23:32:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 533. [2018-07-23 23:32:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-07-23 23:32:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 693 transitions. [2018-07-23 23:32:50,592 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 693 transitions. Word has length 48 [2018-07-23 23:32:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 23:32:50,592 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 693 transitions. [2018-07-23 23:32:50,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 23:32:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 693 transitions. [2018-07-23 23:32:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 23:32:50,593 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 23:32:50,593 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 23:32:50,593 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 23:32:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2013923031, now seen corresponding path program 9 times [2018-07-23 23:32:50,593 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-23 23:32:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-23 23:32:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:50,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 23:32:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 23:32:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 23:32:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 23:32:51,162 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 23:32:51,162 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 23:32:51,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown