java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label06_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:35:02,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:35:02,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:35:02,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:35:02,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:35:02,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:35:02,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:35:02,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:35:02,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:35:02,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:35:02,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:35:02,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:35:02,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:35:02,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:35:02,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:35:02,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:35:02,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:35:02,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:35:02,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:35:02,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:35:02,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:35:02,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:35:02,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:35:02,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:35:02,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:35:02,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:35:02,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:35:02,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:35:02,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:35:02,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:35:02,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:35:02,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:35:02,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:35:02,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:35:02,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:35:02,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:35:02,716 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:35:02,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:35:02,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:35:02,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:35:02,731 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:35:02,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:35:02,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:35:02,732 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:35:02,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:35:02,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:35:02,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:35:02,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:35:02,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:35:02,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:35:02,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:35:02,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:35:02,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:35:02,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:35:02,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:35:02,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:35:02,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:35:02,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:35:02,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:35:02,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:35:02,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:35:02,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:35:02,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:35:02,736 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:35:02,736 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:35:02,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:35:02,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:35:02,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:35:02,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:35:02,803 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:35:02,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label06_false-unreach-call.c [2018-11-06 19:35:02,870 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe560572/ed4128a6622d4c49b005b6447039c585/FLAG7b68b9b34 [2018-11-06 19:35:03,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:35:03,626 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label06_false-unreach-call.c [2018-11-06 19:35:03,655 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe560572/ed4128a6622d4c49b005b6447039c585/FLAG7b68b9b34 [2018-11-06 19:35:03,675 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe560572/ed4128a6622d4c49b005b6447039c585 [2018-11-06 19:35:03,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:35:03,691 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:35:03,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:35:03,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:35:03,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:35:03,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:35:03" (1/1) ... [2018-11-06 19:35:03,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7293a3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:03, skipping insertion in model container [2018-11-06 19:35:03,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:35:03" (1/1) ... [2018-11-06 19:35:03,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:35:03,849 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:35:04,893 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:35:04,898 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:35:05,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:35:05,380 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:35:05,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05 WrapperNode [2018-11-06 19:35:05,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:35:05,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:35:05,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:35:05,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:35:05,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:05,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:05,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:35:05,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:35:05,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:35:05,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:35:05,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:05,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:05,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:05,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:06,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:06,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:06,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... [2018-11-06 19:35:06,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:35:06,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:35:06,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:35:06,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:35:06,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:35:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:35:06,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:35:06,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:35:13,364 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:35:13,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:13 BoogieIcfgContainer [2018-11-06 19:35:13,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:35:13,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:35:13,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:35:13,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:35:13,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:35:03" (1/3) ... [2018-11-06 19:35:13,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d623f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:35:13, skipping insertion in model container [2018-11-06 19:35:13,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:35:05" (2/3) ... [2018-11-06 19:35:13,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d623f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:35:13, skipping insertion in model container [2018-11-06 19:35:13,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:35:13" (3/3) ... [2018-11-06 19:35:13,374 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label06_false-unreach-call.c [2018-11-06 19:35:13,384 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:35:13,398 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:35:13,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:35:13,467 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:35:13,468 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:35:13,468 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:35:13,468 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:35:13,468 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:35:13,468 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:35:13,469 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:35:13,469 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:35:13,469 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:35:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2018-11-06 19:35:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-06 19:35:13,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:13,525 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, 1, 1, 1] [2018-11-06 19:35:13,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:13,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1580163962, now seen corresponding path program 1 times [2018-11-06 19:35:13,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:13,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:13,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:13,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:35:14,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:14,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:35:14,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:35:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:35:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:14,039 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2018-11-06 19:35:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:24,070 INFO L93 Difference]: Finished difference Result 2902 states and 5650 transitions. [2018-11-06 19:35:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:35:24,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-06 19:35:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:24,113 INFO L225 Difference]: With dead ends: 2902 [2018-11-06 19:35:24,113 INFO L226 Difference]: Without dead ends: 2137 [2018-11-06 19:35:24,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-11-06 19:35:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2018-11-06 19:35:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-06 19:35:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3734 transitions. [2018-11-06 19:35:24,310 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3734 transitions. Word has length 26 [2018-11-06 19:35:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:24,310 INFO L480 AbstractCegarLoop]: Abstraction has 2137 states and 3734 transitions. [2018-11-06 19:35:24,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:35:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3734 transitions. [2018-11-06 19:35:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-06 19:35:24,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:24,319 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-06 19:35:24,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:24,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:24,321 INFO L82 PathProgramCache]: Analyzing trace with hash -7220096, now seen corresponding path program 1 times [2018-11-06 19:35:24,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:24,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:24,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:24,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:35:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:35:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:35:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:35:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:24,738 INFO L87 Difference]: Start difference. First operand 2137 states and 3734 transitions. Second operand 4 states. [2018-11-06 19:35:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:37,467 INFO L93 Difference]: Finished difference Result 7730 states and 13074 transitions. [2018-11-06 19:35:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:35:37,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-06 19:35:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:37,497 INFO L225 Difference]: With dead ends: 7730 [2018-11-06 19:35:37,497 INFO L226 Difference]: Without dead ends: 5595 [2018-11-06 19:35:37,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:35:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2018-11-06 19:35:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 5595. [2018-11-06 19:35:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5595 states. [2018-11-06 19:35:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5595 states to 5595 states and 8527 transitions. [2018-11-06 19:35:37,608 INFO L78 Accepts]: Start accepts. Automaton has 5595 states and 8527 transitions. Word has length 96 [2018-11-06 19:35:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:37,609 INFO L480 AbstractCegarLoop]: Abstraction has 5595 states and 8527 transitions. [2018-11-06 19:35:37,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:35:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5595 states and 8527 transitions. [2018-11-06 19:35:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-06 19:35:37,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:37,614 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:35:37,614 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:37,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 10279458, now seen corresponding path program 1 times [2018-11-06 19:35:37,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:37,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:37,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:37,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:37,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:38,198 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-11-06 19:35:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:35:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:35:38,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:35:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:35:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:35:38,270 INFO L87 Difference]: Start difference. First operand 5595 states and 8527 transitions. Second operand 5 states. [2018-11-06 19:35:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:46,311 INFO L93 Difference]: Finished difference Result 16025 states and 24804 transitions. [2018-11-06 19:35:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:35:46,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-06 19:35:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:46,361 INFO L225 Difference]: With dead ends: 16025 [2018-11-06 19:35:46,361 INFO L226 Difference]: Without dead ends: 10432 [2018-11-06 19:35:46,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:35:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10432 states. [2018-11-06 19:35:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10432 to 9741. [2018-11-06 19:35:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9741 states. [2018-11-06 19:35:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 13118 transitions. [2018-11-06 19:35:46,574 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 13118 transitions. Word has length 145 [2018-11-06 19:35:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:46,575 INFO L480 AbstractCegarLoop]: Abstraction has 9741 states and 13118 transitions. [2018-11-06 19:35:46,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:35:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 13118 transitions. [2018-11-06 19:35:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-06 19:35:46,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:46,589 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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-11-06 19:35:46,589 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:46,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 315138893, now seen corresponding path program 1 times [2018-11-06 19:35:46,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:46,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 115 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:35:47,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:35:47,213 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:35:47,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:47,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:35:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:35:47,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:35:47,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:35:47,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:35:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:35:47,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:35:47,462 INFO L87 Difference]: Start difference. First operand 9741 states and 13118 transitions. Second operand 6 states. [2018-11-06 19:35:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:59,538 INFO L93 Difference]: Finished difference Result 34002 states and 48836 transitions. [2018-11-06 19:35:59,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:35:59,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2018-11-06 19:35:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:59,748 INFO L225 Difference]: With dead ends: 34002 [2018-11-06 19:35:59,748 INFO L226 Difference]: Without dead ends: 23570 [2018-11-06 19:35:59,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:35:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23570 states. [2018-11-06 19:36:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23570 to 17339. [2018-11-06 19:36:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2018-11-06 19:36:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 19653 transitions. [2018-11-06 19:36:00,134 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 19653 transitions. Word has length 282 [2018-11-06 19:36:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:00,135 INFO L480 AbstractCegarLoop]: Abstraction has 17339 states and 19653 transitions. [2018-11-06 19:36:00,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:36:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 19653 transitions. [2018-11-06 19:36:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-11-06 19:36:00,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:00,172 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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-11-06 19:36:00,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:00,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1265390655, now seen corresponding path program 1 times [2018-11-06 19:36:00,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:00,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:00,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-06 19:36:01,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:01,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:01,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:01,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:01,264 INFO L87 Difference]: Start difference. First operand 17339 states and 19653 transitions. Second operand 4 states. [2018-11-06 19:36:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:07,633 INFO L93 Difference]: Finished difference Result 43673 states and 51516 transitions. [2018-11-06 19:36:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:07,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 915 [2018-11-06 19:36:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:07,693 INFO L225 Difference]: With dead ends: 43673 [2018-11-06 19:36:07,693 INFO L226 Difference]: Without dead ends: 27027 [2018-11-06 19:36:07,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27027 states. [2018-11-06 19:36:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27027 to 26336. [2018-11-06 19:36:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26336 states. [2018-11-06 19:36:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26336 states to 26336 states and 30312 transitions. [2018-11-06 19:36:08,128 INFO L78 Accepts]: Start accepts. Automaton has 26336 states and 30312 transitions. Word has length 915 [2018-11-06 19:36:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:08,130 INFO L480 AbstractCegarLoop]: Abstraction has 26336 states and 30312 transitions. [2018-11-06 19:36:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 26336 states and 30312 transitions. [2018-11-06 19:36:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2018-11-06 19:36:08,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:08,188 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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-11-06 19:36:08,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:08,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1742992509, now seen corresponding path program 1 times [2018-11-06 19:36:08,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:08,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:08,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:09,216 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:36:09,650 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-11-06 19:36:09,865 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-11-06 19:36:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 299 proven. 500 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-06 19:36:11,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:36:11,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:36:11,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:11,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:36:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-11-06 19:36:12,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:36:12,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-11-06 19:36:12,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:36:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:36:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:36:12,688 INFO L87 Difference]: Start difference. First operand 26336 states and 30312 transitions. Second operand 10 states. [2018-11-06 19:36:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:35,856 INFO L93 Difference]: Finished difference Result 187461 states and 225774 transitions. [2018-11-06 19:36:35,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-06 19:36:35,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1046 [2018-11-06 19:36:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:36,142 INFO L225 Difference]: With dead ends: 187461 [2018-11-06 19:36:36,142 INFO L226 Difference]: Without dead ends: 161818 [2018-11-06 19:36:36,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1067 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2018-11-06 19:36:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161818 states. [2018-11-06 19:36:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161818 to 65032. [2018-11-06 19:36:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65032 states. [2018-11-06 19:36:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65032 states to 65032 states and 71486 transitions. [2018-11-06 19:36:37,522 INFO L78 Accepts]: Start accepts. Automaton has 65032 states and 71486 transitions. Word has length 1046 [2018-11-06 19:36:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:37,523 INFO L480 AbstractCegarLoop]: Abstraction has 65032 states and 71486 transitions. [2018-11-06 19:36:37,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:36:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 65032 states and 71486 transitions. [2018-11-06 19:36:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-11-06 19:36:37,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:37,566 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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-11-06 19:36:37,566 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:37,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:37,567 INFO L82 PathProgramCache]: Analyzing trace with hash -633946417, now seen corresponding path program 1 times [2018-11-06 19:36:37,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:37,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:37,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-11-06 19:36:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:38,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:38,987 INFO L87 Difference]: Start difference. First operand 65032 states and 71486 transitions. Second operand 4 states. [2018-11-06 19:36:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:44,021 INFO L93 Difference]: Finished difference Result 140413 states and 156529 transitions. [2018-11-06 19:36:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:44,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1067 [2018-11-06 19:36:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:44,119 INFO L225 Difference]: With dead ends: 140413 [2018-11-06 19:36:44,120 INFO L226 Difference]: Without dead ends: 76074 [2018-11-06 19:36:44,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76074 states. [2018-11-06 19:36:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76074 to 72619. [2018-11-06 19:36:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72619 states. [2018-11-06 19:36:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72619 states to 72619 states and 78010 transitions. [2018-11-06 19:36:45,024 INFO L78 Accepts]: Start accepts. Automaton has 72619 states and 78010 transitions. Word has length 1067 [2018-11-06 19:36:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:45,025 INFO L480 AbstractCegarLoop]: Abstraction has 72619 states and 78010 transitions. [2018-11-06 19:36:45,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 72619 states and 78010 transitions. [2018-11-06 19:36:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1509 [2018-11-06 19:36:45,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:45,113 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:36:45,113 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:45,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1575986019, now seen corresponding path program 1 times [2018-11-06 19:36:45,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:46,042 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 19:36:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 1317 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-06 19:36:47,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:47,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:47,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:47,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:47,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:47,181 INFO L87 Difference]: Start difference. First operand 72619 states and 78010 transitions. Second operand 4 states. [2018-11-06 19:36:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:53,239 INFO L93 Difference]: Finished difference Result 189460 states and 203780 transitions. [2018-11-06 19:36:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:53,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1508 [2018-11-06 19:36:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:53,357 INFO L225 Difference]: With dead ends: 189460 [2018-11-06 19:36:53,357 INFO L226 Difference]: Without dead ends: 117534 [2018-11-06 19:36:53,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117534 states. [2018-11-06 19:36:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117534 to 111315. [2018-11-06 19:36:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111315 states. [2018-11-06 19:36:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111315 states to 111315 states and 118479 transitions. [2018-11-06 19:36:54,396 INFO L78 Accepts]: Start accepts. Automaton has 111315 states and 118479 transitions. Word has length 1508 [2018-11-06 19:36:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:54,397 INFO L480 AbstractCegarLoop]: Abstraction has 111315 states and 118479 transitions. [2018-11-06 19:36:54,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 111315 states and 118479 transitions. [2018-11-06 19:36:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1561 [2018-11-06 19:36:54,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:54,467 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:36:54,467 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:54,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1587940758, now seen corresponding path program 1 times [2018-11-06 19:36:54,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:54,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:54,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1160 proven. 0 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-11-06 19:36:56,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:56,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:56,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:56,946 INFO L87 Difference]: Start difference. First operand 111315 states and 118479 transitions. Second operand 4 states. [2018-11-06 19:37:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:02,113 INFO L93 Difference]: Finished difference Result 233684 states and 248891 transitions. [2018-11-06 19:37:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:37:02,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1560 [2018-11-06 19:37:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:02,230 INFO L225 Difference]: With dead ends: 233684 [2018-11-06 19:37:02,231 INFO L226 Difference]: Without dead ends: 110601 [2018-11-06 19:37:02,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110601 states. [2018-11-06 19:37:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110601 to 109910. [2018-11-06 19:37:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109910 states. [2018-11-06 19:37:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109910 states to 109910 states and 114343 transitions. [2018-11-06 19:37:03,133 INFO L78 Accepts]: Start accepts. Automaton has 109910 states and 114343 transitions. Word has length 1560 [2018-11-06 19:37:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:03,134 INFO L480 AbstractCegarLoop]: Abstraction has 109910 states and 114343 transitions. [2018-11-06 19:37:03,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:37:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 109910 states and 114343 transitions. [2018-11-06 19:37:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1723 [2018-11-06 19:37:03,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:03,214 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:37:03,214 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:03,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash 457997503, now seen corresponding path program 1 times [2018-11-06 19:37:03,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:03,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:03,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:03,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:03,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:05,396 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-11-06 19:37:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2615 backedges. 1515 proven. 1008 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 19:37:09,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:37:09,459 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:37:09,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:09,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:37:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2615 backedges. 1916 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-11-06 19:37:11,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:37:11,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-11-06 19:37:11,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 19:37:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 19:37:11,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:37:11,744 INFO L87 Difference]: Start difference. First operand 109910 states and 114343 transitions. Second operand 12 states. [2018-11-06 19:37:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:29,863 INFO L93 Difference]: Finished difference Result 259926 states and 270554 transitions. [2018-11-06 19:37:29,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-06 19:37:29,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1722 [2018-11-06 19:37:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:30,049 INFO L225 Difference]: With dead ends: 259926 [2018-11-06 19:37:30,050 INFO L226 Difference]: Without dead ends: 150709 [2018-11-06 19:37:30,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1743 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2018-11-06 19:37:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150709 states. [2018-11-06 19:37:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150709 to 103691. [2018-11-06 19:37:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103691 states. [2018-11-06 19:37:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103691 states to 103691 states and 106149 transitions. [2018-11-06 19:37:31,740 INFO L78 Accepts]: Start accepts. Automaton has 103691 states and 106149 transitions. Word has length 1722 [2018-11-06 19:37:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:31,741 INFO L480 AbstractCegarLoop]: Abstraction has 103691 states and 106149 transitions. [2018-11-06 19:37:31,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 19:37:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 103691 states and 106149 transitions. [2018-11-06 19:37:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1793 [2018-11-06 19:37:31,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:31,812 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:37:31,812 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:31,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash 603042489, now seen corresponding path program 1 times [2018-11-06 19:37:31,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:31,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:31,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:31,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3056 backedges. 2287 proven. 70 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-11-06 19:37:35,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:37:35,437 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:37:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:35,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:37:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3056 backedges. 2287 proven. 70 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-11-06 19:37:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:37:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-06 19:37:37,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:37:37,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:37:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:37,151 INFO L87 Difference]: Start difference. First operand 103691 states and 106149 transitions. Second operand 4 states. [2018-11-06 19:37:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:43,603 INFO L93 Difference]: Finished difference Result 219817 states and 225155 transitions. [2018-11-06 19:37:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:37:43,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1792 [2018-11-06 19:37:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:43,723 INFO L225 Difference]: With dead ends: 219817 [2018-11-06 19:37:43,724 INFO L226 Difference]: Without dead ends: 116819 [2018-11-06 19:37:43,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1796 GetRequests, 1792 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116819 states. [2018-11-06 19:37:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116819 to 109218. [2018-11-06 19:37:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109218 states. [2018-11-06 19:37:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109218 states to 109218 states and 111760 transitions. [2018-11-06 19:37:45,274 INFO L78 Accepts]: Start accepts. Automaton has 109218 states and 111760 transitions. Word has length 1792 [2018-11-06 19:37:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:45,275 INFO L480 AbstractCegarLoop]: Abstraction has 109218 states and 111760 transitions. [2018-11-06 19:37:45,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:37:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 109218 states and 111760 transitions. [2018-11-06 19:37:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1884 [2018-11-06 19:37:45,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:45,351 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:37:45,352 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:45,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -491800528, now seen corresponding path program 1 times [2018-11-06 19:37:45,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:45,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:45,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:46,541 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:37:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 2118 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2018-11-06 19:37:48,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:37:48,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:37:48,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:37:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:37:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:48,064 INFO L87 Difference]: Start difference. First operand 109218 states and 111760 transitions. Second operand 4 states. [2018-11-06 19:37:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:53,101 INFO L93 Difference]: Finished difference Result 226721 states and 232101 transitions. [2018-11-06 19:37:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:37:53,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1883 [2018-11-06 19:37:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:53,211 INFO L225 Difference]: With dead ends: 226721 [2018-11-06 19:37:53,212 INFO L226 Difference]: Without dead ends: 118196 [2018-11-06 19:37:53,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118196 states. [2018-11-06 19:37:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118196 to 114050. [2018-11-06 19:37:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114050 states. [2018-11-06 19:37:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114050 states to 114050 states and 116141 transitions. [2018-11-06 19:37:54,800 INFO L78 Accepts]: Start accepts. Automaton has 114050 states and 116141 transitions. Word has length 1883 [2018-11-06 19:37:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:54,801 INFO L480 AbstractCegarLoop]: Abstraction has 114050 states and 116141 transitions. [2018-11-06 19:37:54,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:37:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 114050 states and 116141 transitions. [2018-11-06 19:37:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2006 [2018-11-06 19:37:54,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:54,870 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:37:54,870 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:54,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1803355823, now seen corresponding path program 1 times [2018-11-06 19:37:54,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:54,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:56,083 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 19:37:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 2455 proven. 0 refuted. 0 times theorem prover too weak. 1419 trivial. 0 not checked. [2018-11-06 19:37:57,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:37:57,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:37:57,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:37:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:37:57,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:57,743 INFO L87 Difference]: Start difference. First operand 114050 states and 116141 transitions. Second operand 4 states. [2018-11-06 19:38:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:38:02,998 INFO L93 Difference]: Finished difference Result 232932 states and 237209 transitions. [2018-11-06 19:38:02,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:38:03,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2005 [2018-11-06 19:38:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:38:03,126 INFO L225 Difference]: With dead ends: 232932 [2018-11-06 19:38:03,126 INFO L226 Difference]: Without dead ends: 119575 [2018-11-06 19:38:03,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:38:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119575 states. [2018-11-06 19:38:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119575 to 110592. [2018-11-06 19:38:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110592 states. [2018-11-06 19:38:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110592 states to 110592 states and 112471 transitions. [2018-11-06 19:38:04,156 INFO L78 Accepts]: Start accepts. Automaton has 110592 states and 112471 transitions. Word has length 2005 [2018-11-06 19:38:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:38:04,157 INFO L480 AbstractCegarLoop]: Abstraction has 110592 states and 112471 transitions. [2018-11-06 19:38:04,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:38:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 110592 states and 112471 transitions. [2018-11-06 19:38:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2124 [2018-11-06 19:38:04,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:38:04,230 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:38:04,230 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:38:04,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:38:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1319634156, now seen corresponding path program 1 times [2018-11-06 19:38:04,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:38:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:38:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:04,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:38:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:38:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 3146 proven. 0 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2018-11-06 19:38:07,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:38:07,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:38:07,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:38:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:38:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:38:07,399 INFO L87 Difference]: Start difference. First operand 110592 states and 112471 transitions. Second operand 4 states. [2018-11-06 19:38:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:38:12,272 INFO L93 Difference]: Finished difference Result 243293 states and 247474 transitions. [2018-11-06 19:38:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:38:12,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2123 [2018-11-06 19:38:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:38:12,402 INFO L225 Difference]: With dead ends: 243293 [2018-11-06 19:38:12,402 INFO L226 Difference]: Without dead ends: 133394 [2018-11-06 19:38:12,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:38:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133394 states. [2018-11-06 19:38:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133394 to 127864. [2018-11-06 19:38:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127864 states. [2018-11-06 19:38:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127864 states to 127864 states and 129776 transitions. [2018-11-06 19:38:14,094 INFO L78 Accepts]: Start accepts. Automaton has 127864 states and 129776 transitions. Word has length 2123 [2018-11-06 19:38:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:38:14,095 INFO L480 AbstractCegarLoop]: Abstraction has 127864 states and 129776 transitions. [2018-11-06 19:38:14,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:38:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 127864 states and 129776 transitions. [2018-11-06 19:38:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2174 [2018-11-06 19:38:14,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:38:14,181 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:38:14,181 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:38:14,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:38:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1779036097, now seen corresponding path program 1 times [2018-11-06 19:38:14,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:38:14,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:38:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:14,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:38:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:38:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4227 backedges. 2540 proven. 174 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2018-11-06 19:38:20,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:38:20,059 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:38:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:38:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:38:20,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:38:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4227 backedges. 2540 proven. 174 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2018-11-06 19:38:22,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:38:22,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-06 19:38:22,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:38:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:38:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:38:22,554 INFO L87 Difference]: Start difference. First operand 127864 states and 129776 transitions. Second operand 4 states. [2018-11-06 19:38:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:38:27,447 INFO L93 Difference]: Finished difference Result 257108 states and 260965 transitions. [2018-11-06 19:38:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:38:27,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2173 [2018-11-06 19:38:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:38:27,580 INFO L225 Difference]: With dead ends: 257108 [2018-11-06 19:38:27,580 INFO L226 Difference]: Without dead ends: 129937 [2018-11-06 19:38:27,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2177 GetRequests, 2173 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:38:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129937 states. [2018-11-06 19:38:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129937 to 120263. [2018-11-06 19:38:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120263 states. [2018-11-06 19:38:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120263 states to 120263 states and 121949 transitions. [2018-11-06 19:38:29,140 INFO L78 Accepts]: Start accepts. Automaton has 120263 states and 121949 transitions. Word has length 2173 [2018-11-06 19:38:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:38:29,141 INFO L480 AbstractCegarLoop]: Abstraction has 120263 states and 121949 transitions. [2018-11-06 19:38:29,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:38:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 120263 states and 121949 transitions. [2018-11-06 19:38:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2018-11-06 19:38:29,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:38:29,226 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:38:29,226 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:38:29,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:38:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1433622822, now seen corresponding path program 1 times [2018-11-06 19:38:29,227 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:38:29,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:38:29,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:29,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:38:29,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:38:30,918 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 19:38:31,130 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-11-06 19:38:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4947 backedges. 3143 proven. 0 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2018-11-06 19:38:34,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:38:34,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:38:34,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:38:34,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:38:34,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:38:34,101 INFO L87 Difference]: Start difference. First operand 120263 states and 121949 transitions. Second operand 5 states. [2018-11-06 19:38:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:38:40,980 INFO L93 Difference]: Finished difference Result 253654 states and 257211 transitions. [2018-11-06 19:38:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:38:40,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2284 [2018-11-06 19:38:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:38:41,106 INFO L225 Difference]: With dead ends: 253654 [2018-11-06 19:38:41,106 INFO L226 Difference]: Without dead ends: 134084 [2018-11-06 19:38:41,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:38:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134084 states. [2018-11-06 19:38:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134084 to 121645. [2018-11-06 19:38:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121645 states. [2018-11-06 19:38:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121645 states to 121645 states and 123370 transitions. [2018-11-06 19:38:42,419 INFO L78 Accepts]: Start accepts. Automaton has 121645 states and 123370 transitions. Word has length 2284 [2018-11-06 19:38:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:38:42,421 INFO L480 AbstractCegarLoop]: Abstraction has 121645 states and 123370 transitions. [2018-11-06 19:38:42,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:38:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 121645 states and 123370 transitions. [2018-11-06 19:38:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2340 [2018-11-06 19:38:42,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:38:42,506 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-11-06 19:38:42,506 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:38:42,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:38:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1193316547, now seen corresponding path program 1 times [2018-11-06 19:38:42,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:38:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:38:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:42,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:38:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:38:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:38:43,861 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 Received shutdown request... [2018-11-06 19:38:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4819 backedges. 2679 proven. 1283 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2018-11-06 19:38:49,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:38:49,954 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:38:49,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:38:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:38:50,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:38:50,495 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-06 19:38:50,697 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:38:50,697 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:38:50,702 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:38:50,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:38:50 BoogieIcfgContainer [2018-11-06 19:38:50,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:38:50,703 INFO L168 Benchmark]: Toolchain (without parser) took 227013.13 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 774.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:38:50,704 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:38:50,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1689.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:38:50,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 540.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -920.7 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:38:50,707 INFO L168 Benchmark]: Boogie Preprocessor took 246.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:38:50,707 INFO L168 Benchmark]: RCFGBuilder took 7194.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 542.5 MB). Peak memory consumption was 542.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:38:50,712 INFO L168 Benchmark]: TraceAbstraction took 217336.42 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.4 GB). Free memory was 1.6 GB in the beginning and 3.7 GB in the end (delta: -2.1 GB). Peak memory consumption was 213.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:38:50,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1689.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 540.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -920.7 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 246.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7194.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 542.5 MB). Peak memory consumption was 542.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217336.42 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.4 GB). Free memory was 1.6 GB in the beginning and 3.7 GB in the end (delta: -2.1 GB). Peak memory consumption was 213.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 84). Cancelled while BasicCegarLoop was analyzing trace of length 2340 with TraceHistMax 8,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 758 locations, 1 error locations. TIMEOUT Result, 217.2s OverallTime, 17 OverallIterations, 8 TraceHistogramMax, 142.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8182 SDtfs, 54367 SDslu, 2111 SDs, 0 SdLazy, 89499 SolverSat, 17650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7190 GetRequests, 7076 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127864occurred in iteration=14, 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: 15.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 210155 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 27642 NumberOfCodeBlocks, 27642 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 27621 ConstructedInterpolants, 0 QuantifiedInterpolants, 92481157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7956 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 41277/43277 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown