java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:19:09,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:19:09,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:19:09,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:19:09,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:19:09,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:19:09,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:19:09,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:19:09,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:19:09,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:19:09,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:19:09,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:19:09,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:19:09,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:19:09,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:19:09,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:19:09,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:19:09,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:19:09,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:19:09,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:19:09,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:19:09,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:19:09,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:19:09,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:19:09,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:19:09,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:19:09,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:19:09,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:19:09,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:19:09,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:19:09,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:19:09,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:19:09,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:19:09,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:19:09,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:19:09,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:19:09,115 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 22:19:09,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:19:09,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:19:09,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:19:09,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:19:09,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:19:09,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:19:09,132 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:19:09,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:19:09,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:19:09,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:19:09,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:19:09,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:19:09,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:19:09,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:19:09,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:19:09,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:19:09,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:19:09,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:19:09,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:19:09,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:19:09,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:19:09,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:19:09,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:19:09,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:19:09,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:19:09,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:19:09,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:19:09,136 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:19:09,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:19:09,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:19:09,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:19:09,200 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:19:09,200 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:19:09,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-26 22:19:09,278 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78d2ca73a/18d3b412e47e4489ad540b512f471c55/FLAG4dabf5cd3 [2018-10-26 22:19:09,740 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:19:09,741 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-26 22:19:09,747 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78d2ca73a/18d3b412e47e4489ad540b512f471c55/FLAG4dabf5cd3 [2018-10-26 22:19:09,763 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/78d2ca73a/18d3b412e47e4489ad540b512f471c55 [2018-10-26 22:19:09,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:19:09,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:19:09,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:19:09,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:19:09,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:19:09,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:19:09" (1/1) ... [2018-10-26 22:19:09,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401f344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:09, skipping insertion in model container [2018-10-26 22:19:09,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:19:09" (1/1) ... [2018-10-26 22:19:09,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:19:09,821 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:19:10,041 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:19:10,048 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:19:10,082 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:19:10,106 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:19:10,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10 WrapperNode [2018-10-26 22:19:10,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:19:10,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:19:10,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:19:10,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:19:10,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:19:10,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:19:10,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:19:10,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:19:10,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... [2018-10-26 22:19:10,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:19:10,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:19:10,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:19:10,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:19:10,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:10,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 22:19:10,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 22:19:10,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:19:10,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:19:10,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 22:19:10,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 22:19:10,819 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:19:10,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:19:10 BoogieIcfgContainer [2018-10-26 22:19:10,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:19:10,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:19:10,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:19:10,824 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:19:10,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:19:09" (1/3) ... [2018-10-26 22:19:10,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450db958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:19:10, skipping insertion in model container [2018-10-26 22:19:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:19:10" (2/3) ... [2018-10-26 22:19:10,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450db958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:19:10, skipping insertion in model container [2018-10-26 22:19:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:19:10" (3/3) ... [2018-10-26 22:19:10,828 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-10-26 22:19:10,837 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:19:10,845 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:19:10,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:19:10,888 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:19:10,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:19:10,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:19:10,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:19:10,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:19:10,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:19:10,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:19:10,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:19:10,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:19:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-26 22:19:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 22:19:10,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:10,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:10,918 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:10,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -794186159, now seen corresponding path program 1 times [2018-10-26 22:19:10,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:10,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:11,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:19:11,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:19:11,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:19:11,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:19:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:19:11,095 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-26 22:19:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:11,116 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-10-26 22:19:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:19:11,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 22:19:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:11,129 INFO L225 Difference]: With dead ends: 75 [2018-10-26 22:19:11,129 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 22:19:11,133 INFO L605 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-10-26 22:19:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 22:19:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-26 22:19:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 22:19:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-26 22:19:11,175 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 21 [2018-10-26 22:19:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:11,175 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-26 22:19:11,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:19:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-26 22:19:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 22:19:11,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:11,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:11,178 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:11,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash -593923913, now seen corresponding path program 1 times [2018-10-26 22:19:11,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:19:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:19:11,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:19:11,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:19:11,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:19:11,310 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 3 states. [2018-10-26 22:19:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:11,486 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-10-26 22:19:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:19:11,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 22:19:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:11,487 INFO L225 Difference]: With dead ends: 71 [2018-10-26 22:19:11,487 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 22:19:11,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:19:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 22:19:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-26 22:19:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 22:19:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-10-26 22:19:11,500 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-10-26 22:19:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:11,500 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-10-26 22:19:11,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:19:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-10-26 22:19:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:19:11,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:11,502 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:11,502 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:11,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 496444158, now seen corresponding path program 1 times [2018-10-26 22:19:11,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:11,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:11,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:11,615 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:11,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:11,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:11,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:11,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-26 22:19:11,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:19:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:19:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:19:11,722 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2018-10-26 22:19:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:11,911 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-10-26 22:19:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:19:11,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-26 22:19:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:11,914 INFO L225 Difference]: With dead ends: 75 [2018-10-26 22:19:11,914 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 22:19:11,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:19:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 22:19:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-10-26 22:19:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 22:19:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-10-26 22:19:11,922 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-10-26 22:19:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:11,922 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-10-26 22:19:11,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:19:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-10-26 22:19:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 22:19:11,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:11,924 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:11,925 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:11,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:11,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1750358469, now seen corresponding path program 2 times [2018-10-26 22:19:11,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:11,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:12,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:12,056 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:19:12,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-26 22:19:12,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:12,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:19:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:19:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-10-26 22:19:12,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:19:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:19:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:19:12,325 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2018-10-26 22:19:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:12,658 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-10-26 22:19:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:19:12,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-26 22:19:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:12,659 INFO L225 Difference]: With dead ends: 94 [2018-10-26 22:19:12,659 INFO L226 Difference]: Without dead ends: 68 [2018-10-26 22:19:12,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:19:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-26 22:19:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2018-10-26 22:19:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 22:19:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-26 22:19:12,669 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 31 [2018-10-26 22:19:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:12,670 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-26 22:19:12,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:19:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-26 22:19:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 22:19:12,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:12,672 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:12,672 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:12,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2127477742, now seen corresponding path program 1 times [2018-10-26 22:19:12,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:12,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:19:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:12,781 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:12,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:19:12,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:12,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-26 22:19:12,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:19:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:19:12,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:19:12,882 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-10-26 22:19:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:13,025 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-10-26 22:19:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:19:13,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-26 22:19:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:13,027 INFO L225 Difference]: With dead ends: 87 [2018-10-26 22:19:13,027 INFO L226 Difference]: Without dead ends: 59 [2018-10-26 22:19:13,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:19:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-26 22:19:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-26 22:19:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 22:19:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-10-26 22:19:13,043 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 46 [2018-10-26 22:19:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:13,044 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-10-26 22:19:13,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:19:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-10-26 22:19:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 22:19:13,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:13,048 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:13,048 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:13,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:13,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1834611179, now seen corresponding path program 2 times [2018-10-26 22:19:13,053 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:13,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:19:13,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:13,341 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:13,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:19:13,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:19:13,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:13,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:19:13,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:13,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-26 22:19:13,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:19:13,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:19:13,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:19:13,417 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-10-26 22:19:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:13,719 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-10-26 22:19:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:19:13,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-26 22:19:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:13,721 INFO L225 Difference]: With dead ends: 125 [2018-10-26 22:19:13,721 INFO L226 Difference]: Without dead ends: 97 [2018-10-26 22:19:13,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:19:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-26 22:19:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2018-10-26 22:19:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-26 22:19:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-10-26 22:19:13,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 50 [2018-10-26 22:19:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:13,730 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-10-26 22:19:13,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:19:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-10-26 22:19:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 22:19:13,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:13,737 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:13,737 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:13,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1755968700, now seen corresponding path program 3 times [2018-10-26 22:19:13,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:13,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:13,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 22:19:13,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:19:13,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:19:13,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:19:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:19:13,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:19:13,973 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-10-26 22:19:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:14,157 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-10-26 22:19:14,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:19:14,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-10-26 22:19:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:14,160 INFO L225 Difference]: With dead ends: 105 [2018-10-26 22:19:14,160 INFO L226 Difference]: Without dead ends: 80 [2018-10-26 22:19:14,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:19:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-26 22:19:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-10-26 22:19:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-26 22:19:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-10-26 22:19:14,168 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 54 [2018-10-26 22:19:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:14,169 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-10-26 22:19:14,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:19:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-10-26 22:19:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 22:19:14,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:14,170 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:14,171 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:14,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1400751282, now seen corresponding path program 1 times [2018-10-26 22:19:14,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:14,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 22:19:14,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:14,273 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:14,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:14,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 22:19:14,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:14,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-26 22:19:14,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:19:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:19:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:19:14,908 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 9 states. [2018-10-26 22:19:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:15,218 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-10-26 22:19:15,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:19:15,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-10-26 22:19:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:15,222 INFO L225 Difference]: With dead ends: 124 [2018-10-26 22:19:15,222 INFO L226 Difference]: Without dead ends: 99 [2018-10-26 22:19:15,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:19:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-26 22:19:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-10-26 22:19:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-26 22:19:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-10-26 22:19:15,233 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 60 [2018-10-26 22:19:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:15,233 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-10-26 22:19:15,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:19:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-10-26 22:19:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 22:19:15,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:15,235 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:15,235 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:15,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash -77800680, now seen corresponding path program 2 times [2018-10-26 22:19:15,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:15,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:15,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:15,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:15,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-26 22:19:15,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:19:15,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:19:15,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:19:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:19:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:19:15,339 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 5 states. [2018-10-26 22:19:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:15,455 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-10-26 22:19:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:19:15,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-10-26 22:19:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:15,456 INFO L225 Difference]: With dead ends: 146 [2018-10-26 22:19:15,456 INFO L226 Difference]: Without dead ends: 101 [2018-10-26 22:19:15,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:19:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-26 22:19:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-10-26 22:19:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-26 22:19:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-10-26 22:19:15,467 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 88 [2018-10-26 22:19:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:15,467 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-10-26 22:19:15,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:19:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-10-26 22:19:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 22:19:15,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:15,469 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:15,470 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:15,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash 916290126, now seen corresponding path program 3 times [2018-10-26 22:19:15,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:15,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:15,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:15,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:15,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-26 22:19:15,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:15,643 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:19:15,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-26 22:19:15,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:15,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-26 22:19:15,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:15,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-26 22:19:15,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:19:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:19:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:19:15,891 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 11 states. [2018-10-26 22:19:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:16,109 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-10-26 22:19:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:19:16,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-10-26 22:19:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:16,110 INFO L225 Difference]: With dead ends: 154 [2018-10-26 22:19:16,111 INFO L226 Difference]: Without dead ends: 107 [2018-10-26 22:19:16,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:19:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-26 22:19:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-10-26 22:19:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-26 22:19:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-10-26 22:19:16,120 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 94 [2018-10-26 22:19:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:16,121 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-10-26 22:19:16,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:19:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-10-26 22:19:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 22:19:16,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:16,123 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:16,124 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:16,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 907761752, now seen corresponding path program 4 times [2018-10-26 22:19:16,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:16,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 22:19:16,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:16,359 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:19:16,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:19:16,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:16,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-26 22:19:16,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:16,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-26 22:19:16,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:19:16,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:19:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:19:16,582 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 15 states. [2018-10-26 22:19:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:17,297 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2018-10-26 22:19:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:19:17,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-10-26 22:19:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:17,301 INFO L225 Difference]: With dead ends: 208 [2018-10-26 22:19:17,301 INFO L226 Difference]: Without dead ends: 161 [2018-10-26 22:19:17,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:19:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-26 22:19:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2018-10-26 22:19:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-26 22:19:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-10-26 22:19:17,330 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 100 [2018-10-26 22:19:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:17,330 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-10-26 22:19:17,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:19:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-10-26 22:19:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:19:17,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:17,336 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:17,336 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:17,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 712625138, now seen corresponding path program 5 times [2018-10-26 22:19:17,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:17,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:17,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 163 proven. 14 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-26 22:19:17,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:17,520 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:17,531 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:19:17,617 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-26 22:19:17,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:17,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:18,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-26 22:19:18,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,352 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 122 [2018-10-26 22:19:18,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2018-10-26 22:19:18,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:19:18,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:19:18,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:102 [2018-10-26 22:19:18,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-26 22:19:18,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:18,984 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 32 treesize of output 97 [2018-10-26 22:19:18,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-10-26 22:19:19,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:19,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-26 22:19:19,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-10-26 22:19:19,179 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 13 treesize of output 12 [2018-10-26 22:19:19,179 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,183 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:19,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 22:19:19,219 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:126, output treesize:88 [2018-10-26 22:19:20,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2018-10-26 22:19:20,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,745 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 181 [2018-10-26 22:19:20,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2018-10-26 22:19:20,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:20,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-10-26 22:19:20,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:20,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-10-26 22:19:20,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:21,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:21,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:19:21,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:167, output treesize:28 [2018-10-26 22:19:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 71 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-26 22:19:21,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:21,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28] total 32 [2018-10-26 22:19:21,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-26 22:19:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-26 22:19:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-10-26 22:19:21,206 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 32 states. [2018-10-26 22:19:24,994 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2018-10-26 22:19:25,319 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-26 22:19:25,686 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-26 22:19:25,968 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-10-26 22:19:26,350 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2018-10-26 22:19:26,610 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-10-26 22:19:26,860 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-26 22:19:27,200 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-10-26 22:19:27,496 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-10-26 22:19:27,716 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2018-10-26 22:19:30,177 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-10-26 22:19:30,692 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 46 [2018-10-26 22:19:31,702 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2018-10-26 22:19:31,887 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-10-26 22:19:32,504 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2018-10-26 22:19:32,713 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-10-26 22:19:33,171 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-10-26 22:19:33,586 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-10-26 22:19:33,999 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-10-26 22:19:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:34,472 INFO L93 Difference]: Finished difference Result 601 states and 682 transitions. [2018-10-26 22:19:34,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-26 22:19:34,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 135 [2018-10-26 22:19:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:34,478 INFO L225 Difference]: With dead ends: 601 [2018-10-26 22:19:34,478 INFO L226 Difference]: Without dead ends: 536 [2018-10-26 22:19:34,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5422 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2483, Invalid=14029, Unknown=0, NotChecked=0, Total=16512 [2018-10-26 22:19:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-26 22:19:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 309. [2018-10-26 22:19:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-26 22:19:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 356 transitions. [2018-10-26 22:19:34,515 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 356 transitions. Word has length 135 [2018-10-26 22:19:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:34,515 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 356 transitions. [2018-10-26 22:19:34,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-26 22:19:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 356 transitions. [2018-10-26 22:19:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 22:19:34,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:34,518 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:34,518 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:34,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash 818812964, now seen corresponding path program 1 times [2018-10-26 22:19:34,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:34,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-10-26 22:19:34,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:34,718 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:34,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:34,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-26 22:19:35,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:35,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-26 22:19:35,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:19:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:19:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:19:35,086 INFO L87 Difference]: Start difference. First operand 309 states and 356 transitions. Second operand 15 states. [2018-10-26 22:19:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:35,717 INFO L93 Difference]: Finished difference Result 585 states and 688 transitions. [2018-10-26 22:19:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:19:35,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 152 [2018-10-26 22:19:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:35,720 INFO L225 Difference]: With dead ends: 585 [2018-10-26 22:19:35,720 INFO L226 Difference]: Without dead ends: 438 [2018-10-26 22:19:35,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-10-26 22:19:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-26 22:19:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 241. [2018-10-26 22:19:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-26 22:19:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2018-10-26 22:19:35,742 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 152 [2018-10-26 22:19:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:35,742 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2018-10-26 22:19:35,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:19:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2018-10-26 22:19:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 22:19:35,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:35,744 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:35,745 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:35,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash -819722602, now seen corresponding path program 2 times [2018-10-26 22:19:35,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:35,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:35,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:35,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:35,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-10-26 22:19:36,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:36,415 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:36,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:19:36,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:19:36,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:36,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:37,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-26 22:19:37,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,207 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 40 treesize of output 55 [2018-10-26 22:19:37,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:26 [2018-10-26 22:19:37,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-26 22:19:37,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-26 22:19:37,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-26 22:19:37,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-26 22:19:37,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:37,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-10-26 22:19:37,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:23 [2018-10-26 22:19:37,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 22:19:37,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 45 [2018-10-26 22:19:37,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-26 22:19:37,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-26 22:19:37,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:37,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 22:19:37,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:37,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-26 22:19:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 119 proven. 357 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 22:19:37,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:37,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31] total 41 [2018-10-26 22:19:37,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-26 22:19:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-26 22:19:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 22:19:37,960 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand 41 states. [2018-10-26 22:19:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:42,066 INFO L93 Difference]: Finished difference Result 694 states and 812 transitions. [2018-10-26 22:19:42,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-26 22:19:42,067 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-26 22:19:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:42,071 INFO L225 Difference]: With dead ends: 694 [2018-10-26 22:19:42,071 INFO L226 Difference]: Without dead ends: 550 [2018-10-26 22:19:42,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=780, Invalid=6026, Unknown=0, NotChecked=0, Total=6806 [2018-10-26 22:19:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-26 22:19:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 359. [2018-10-26 22:19:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-26 22:19:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 408 transitions. [2018-10-26 22:19:42,106 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 408 transitions. Word has length 158 [2018-10-26 22:19:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:42,107 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 408 transitions. [2018-10-26 22:19:42,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-26 22:19:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 408 transitions. [2018-10-26 22:19:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 22:19:42,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:42,109 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:42,109 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:42,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1790866580, now seen corresponding path program 1 times [2018-10-26 22:19:42,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:42,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:42,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:42,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:42,925 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-10-26 22:19:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-10-26 22:19:43,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:43,228 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:43,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:43,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:43,284 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-10-26 22:19:43,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:19:43,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:43,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:43,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 22:19:43,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-26 22:19:43,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:19:43,429 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 12 treesize of output 11 [2018-10-26 22:19:43,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:19:43,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-26 22:19:43,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:43,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:43,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-10-26 22:19:43,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:43,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-26 22:19:43,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:43,630 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 12 treesize of output 11 [2018-10-26 22:19:43,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:43,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:43,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:43,687 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 12 treesize of output 11 [2018-10-26 22:19:43,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:43,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:43,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:43,836 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 12 treesize of output 11 [2018-10-26 22:19:43,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:43,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:44,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:44,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:44,223 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 12 treesize of output 11 [2018-10-26 22:19:44,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:44,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:44,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:44,652 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 12 treesize of output 11 [2018-10-26 22:19:44,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:44,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:44,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:44,843 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 12 treesize of output 11 [2018-10-26 22:19:44,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:44,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:44,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:44,972 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 12 treesize of output 11 [2018-10-26 22:19:44,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:44,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:44,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:45,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:45,008 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 12 treesize of output 11 [2018-10-26 22:19:45,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:45,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:45,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:45,062 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 12 treesize of output 11 [2018-10-26 22:19:45,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:45,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-26 22:19:45,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 37 [2018-10-26 22:19:45,110 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 12 treesize of output 11 [2018-10-26 22:19:45,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:45,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:27 [2018-10-26 22:19:45,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-26 22:19:45,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:45,518 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:19:45,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:45,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-26 22:19:45,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:45,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2018-10-26 22:19:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-10-26 22:19:45,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-10-26 22:19:45,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 22:19:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 22:19:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-10-26 22:19:45,762 INFO L87 Difference]: Start difference. First operand 359 states and 408 transitions. Second operand 31 states. [2018-10-26 22:19:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:48,366 INFO L93 Difference]: Finished difference Result 398 states and 447 transitions. [2018-10-26 22:19:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 22:19:48,366 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2018-10-26 22:19:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:48,369 INFO L225 Difference]: With dead ends: 398 [2018-10-26 22:19:48,369 INFO L226 Difference]: Without dead ends: 396 [2018-10-26 22:19:48,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 22:19:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-26 22:19:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 366. [2018-10-26 22:19:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-26 22:19:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 415 transitions. [2018-10-26 22:19:48,411 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 415 transitions. Word has length 165 [2018-10-26 22:19:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:48,411 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 415 transitions. [2018-10-26 22:19:48,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 22:19:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 415 transitions. [2018-10-26 22:19:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 22:19:48,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:48,414 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:48,414 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:48,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1396560024, now seen corresponding path program 2 times [2018-10-26 22:19:48,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:48,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:19:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:48,957 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 22:19:49,191 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 22:19:49,786 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2018-10-26 22:19:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 155 proven. 202 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-26 22:19:50,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:50,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:50,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:19:51,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:19:51,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:51,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:51,019 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-10-26 22:19:51,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:19:51,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:19:51,075 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 10 treesize of output 9 [2018-10-26 22:19:51,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:19:51,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 22:19:51,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:51,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:19:51,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-26 22:19:51,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:51,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:19:51,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 22:19:51,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-10-26 22:19:51,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 35 [2018-10-26 22:19:51,247 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 12 treesize of output 11 [2018-10-26 22:19:51,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:51,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-10-26 22:19:51,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 44 [2018-10-26 22:19:51,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:19:51,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:51,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-26 22:19:51,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 44 [2018-10-26 22:19:51,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:19:51,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:51,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-26 22:19:51,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 44 [2018-10-26 22:19:51,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:19:51,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:51,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-26 22:19:51,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 44 [2018-10-26 22:19:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:19:51,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:19:51,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-26 22:19:51,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2018-10-26 22:19:59,670 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-10-26 22:20:01,723 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-26 22:20:03,779 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-26 22:20:05,873 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-26 22:20:08,034 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-26 22:20:10,100 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2018-10-26 22:20:12,166 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2018-10-26 22:20:14,241 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2018-10-26 22:20:14,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-10-26 22:20:14,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:20:14,259 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:20:14,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:20:14,260 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:20:14,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-10-26 22:20:14,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:14,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-10-26 22:20:14,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:14,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:14,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:14,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:15 [2018-10-26 22:20:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 203 proven. 47 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-10-26 22:20:14,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:20:14,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16] total 41 [2018-10-26 22:20:14,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-26 22:20:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-26 22:20:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1431, Unknown=3, NotChecked=0, Total=1640 [2018-10-26 22:20:14,446 INFO L87 Difference]: Start difference. First operand 366 states and 415 transitions. Second operand 41 states. [2018-10-26 22:20:38,962 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-26 22:20:43,318 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-26 22:20:47,545 WARN L179 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-10-26 22:20:51,816 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-26 22:20:58,190 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-10-26 22:21:02,409 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-10-26 22:21:06,756 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2018-10-26 22:21:12,952 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-26 22:21:17,243 WARN L179 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-10-26 22:21:21,579 WARN L179 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2018-10-26 22:21:25,923 WARN L179 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-26 22:21:30,133 WARN L179 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-26 22:21:34,310 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-26 22:21:38,547 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-10-26 22:21:42,873 WARN L179 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-10-26 22:21:47,241 WARN L179 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-26 22:21:51,458 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-10-26 22:21:55,929 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-26 22:22:00,202 WARN L179 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2018-10-26 22:22:05,625 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 22:22:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:05,627 INFO L93 Difference]: Finished difference Result 710 states and 814 transitions. [2018-10-26 22:22:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-26 22:22:05,627 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-26 22:22:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:05,629 INFO L225 Difference]: With dead ends: 710 [2018-10-26 22:22:05,630 INFO L226 Difference]: Without dead ends: 400 [2018-10-26 22:22:05,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 166 SyntacticMatches, 24 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 110.0s TimeCoverageRelationStatistics Valid=861, Invalid=3424, Unknown=5, NotChecked=0, Total=4290 [2018-10-26 22:22:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-26 22:22:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2018-10-26 22:22:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 22:22:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 454 transitions. [2018-10-26 22:22:05,679 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 454 transitions. Word has length 172 [2018-10-26 22:22:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:05,679 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 454 transitions. [2018-10-26 22:22:05,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-26 22:22:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 454 transitions. [2018-10-26 22:22:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 22:22:05,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:05,681 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:05,682 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:05,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:05,682 INFO L82 PathProgramCache]: Analyzing trace with hash -896521002, now seen corresponding path program 3 times [2018-10-26 22:22:05,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:22:05,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:22:05,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:05,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:22:05,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:06,755 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-10-26 22:22:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 208 proven. 44 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-26 22:22:07,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:07,212 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:22:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:22:07,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-26 22:22:07,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:22:07,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:07,389 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-10-26 22:22:07,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:22:07,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:22:07,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:22:07,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-26 22:22:07,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:22:07,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,451 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-10-26 22:22:07,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-26 22:22:07,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-26 22:22:07,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,495 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 23 treesize of output 46 [2018-10-26 22:22:07,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-10-26 22:22:07,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-10-26 22:22:07,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,634 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,638 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 30 treesize of output 77 [2018-10-26 22:22:07,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-10-26 22:22:07,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-10-26 22:22:07,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,711 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,712 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,713 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,726 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,727 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-10-26 22:22:07,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-10-26 22:22:07,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:22:07,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 22:22:07,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-10-26 22:22:07,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 60 [2018-10-26 22:22:07,934 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 12 treesize of output 11 [2018-10-26 22:22:07,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:07,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:22:07,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-10-26 22:22:08,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 69 [2018-10-26 22:22:08,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:22:08,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:08,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:08,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:22:08,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-26 22:22:08,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 69 [2018-10-26 22:22:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:22:08,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:08,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:08,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:22:08,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-26 22:22:08,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 69 [2018-10-26 22:22:08,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:22:08,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:08,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:08,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:22:08,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-26 22:22:09,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 69 [2018-10-26 22:22:09,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:22:09,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:09,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:09,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-26 22:22:09,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2018-10-26 22:22:17,162 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-26 22:22:19,230 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2018-10-26 22:22:21,304 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 51 [2018-10-26 22:22:23,399 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 52 [2018-10-26 22:22:23,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-10-26 22:22:23,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-10-26 22:22:23,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-10-26 22:22:23,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:23,443 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:79, output treesize:10 [2018-10-26 22:22:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 77 proven. 14 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-26 22:22:23,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:22:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-10-26 22:22:23,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 22:22:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 22:22:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=953, Unknown=3, NotChecked=0, Total=1122 [2018-10-26 22:22:23,573 INFO L87 Difference]: Start difference. First operand 399 states and 454 transitions. Second operand 34 states. [2018-10-26 22:22:42,077 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 50 [2018-10-26 22:22:46,370 WARN L179 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-10-26 22:22:50,752 WARN L179 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-26 22:22:55,101 WARN L179 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-10-26 22:22:59,367 WARN L179 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-10-26 22:23:03,859 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-26 22:23:08,236 WARN L179 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-10-26 22:23:12,843 WARN L179 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-10-26 22:23:25,187 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-10-26 22:23:31,695 WARN L179 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-10-26 22:23:42,110 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 Received shutdown request... [2018-10-26 22:23:46,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 22:23:46,132 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 22:23:46,139 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 22:23:46,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:23:46 BoogieIcfgContainer [2018-10-26 22:23:46,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:23:46,140 INFO L168 Benchmark]: Toolchain (without parser) took 276365.72 ms. Allocated memory was 1.6 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -293.3 MB). Peak memory consumption was 814.5 MB. Max. memory is 7.1 GB. [2018-10-26 22:23:46,141 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:23:46,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.61 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-26 22:23:46,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:23:46,141 INFO L168 Benchmark]: Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:23:46,142 INFO L168 Benchmark]: RCFGBuilder took 643.45 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2018-10-26 22:23:46,142 INFO L168 Benchmark]: TraceAbstraction took 275318.26 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 356.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 466.6 MB). Peak memory consumption was 823.1 MB. Max. memory is 7.1 GB. [2018-10-26 22:23:46,144 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.61 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 643.45 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275318.26 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 356.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 466.6 MB). Peak memory consumption was 823.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (399states) and FLOYD_HOARE automaton (currently 21 states, 34 states before enhancement),while ReachableStatesComputation was computing reachable states (64 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. TIMEOUT Result, 275.2s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 217.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 703 SDtfs, 3826 SDslu, 4385 SDs, 0 SdLazy, 5889 SolverSat, 891 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 56.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1857 GetRequests, 1332 SyntacticMatches, 38 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10057 ImplicationChecksByTransitivity, 208.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 749 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 55.5s InterpolantComputationTime, 2910 NumberOfCodeBlocks, 2784 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2880 ConstructedInterpolants, 215 QuantifiedInterpolants, 4127164 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2178 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 5786/7005 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown