java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 18:21:37,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 18:21:37,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 18:21:37,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 18:21:37,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 18:21:37,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 18:21:37,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 18:21:37,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 18:21:37,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 18:21:37,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 18:21:37,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 18:21:37,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 18:21:37,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 18:21:37,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 18:21:37,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 18:21:37,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 18:21:37,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 18:21:37,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 18:21:37,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 18:21:37,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 18:21:37,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 18:21:37,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 18:21:37,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 18:21:37,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 18:21:37,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 18:21:37,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 18:21:37,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 18:21:37,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 18:21:37,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 18:21:37,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 18:21:37,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 18:21:37,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 18:21:37,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 18:21:37,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 18:21:37,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 18:21:37,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 18:21:37,715 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 18:21:37,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 18:21:37,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 18:21:37,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 18:21:37,744 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 18:21:37,745 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 18:21:37,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 18:21:37,745 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 18:21:37,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 18:21:37,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 18:21:37,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 18:21:37,746 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 18:21:37,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 18:21:37,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 18:21:37,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 18:21:37,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 18:21:37,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 18:21:37,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 18:21:37,749 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 18:21:37,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 18:21:37,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 18:21:37,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 18:21:37,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 18:21:37,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 18:21:37,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 18:21:37,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 18:21:37,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 18:21:37,751 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 18:21:37,751 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 18:21:37,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 18:21:37,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 18:21:37,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 18:21:37,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 18:21:37,846 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 18:21:37,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c [2018-10-26 18:21:37,912 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fb3e74601/3399a3d4567c4e6eb6d31dd0d3219b3c/FLAG363cb43c5 [2018-10-26 18:21:38,586 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 18:21:38,587 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c [2018-10-26 18:21:38,609 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fb3e74601/3399a3d4567c4e6eb6d31dd0d3219b3c/FLAG363cb43c5 [2018-10-26 18:21:38,630 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fb3e74601/3399a3d4567c4e6eb6d31dd0d3219b3c [2018-10-26 18:21:38,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 18:21:38,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 18:21:38,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 18:21:38,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 18:21:38,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 18:21:38,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:21:38" (1/1) ... [2018-10-26 18:21:38,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a802b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38, skipping insertion in model container [2018-10-26 18:21:38,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:21:38" (1/1) ... [2018-10-26 18:21:38,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 18:21:38,743 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 18:21:39,476 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 18:21:39,483 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 18:21:39,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 18:21:39,918 INFO L193 MainTranslator]: Completed translation [2018-10-26 18:21:39,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39 WrapperNode [2018-10-26 18:21:39,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 18:21:39,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 18:21:39,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 18:21:39,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 18:21:39,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:39,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 18:21:40,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 18:21:40,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 18:21:40,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 18:21:40,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... [2018-10-26 18:21:40,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 18:21:40,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 18:21:40,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 18:21:40,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 18:21:40,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 18:21:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 18:21:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 18:21:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 18:21:46,474 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 18:21:46,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:21:46 BoogieIcfgContainer [2018-10-26 18:21:46,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 18:21:46,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 18:21:46,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 18:21:46,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 18:21:46,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 06:21:38" (1/3) ... [2018-10-26 18:21:46,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dec3b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:21:46, skipping insertion in model container [2018-10-26 18:21:46,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:39" (2/3) ... [2018-10-26 18:21:46,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dec3b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:21:46, skipping insertion in model container [2018-10-26 18:21:46,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:21:46" (3/3) ... [2018-10-26 18:21:46,485 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label09_false-unreach-call.c [2018-10-26 18:21:46,496 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 18:21:46,511 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 18:21:46,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 18:21:46,572 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 18:21:46,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 18:21:46,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 18:21:46,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 18:21:46,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 18:21:46,574 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 18:21:46,574 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 18:21:46,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 18:21:46,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 18:21:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 18:21:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 18:21:46,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:46,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:21:46,626 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:46,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1638960046, now seen corresponding path program 1 times [2018-10-26 18:21:46,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:46,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:46,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:21:47,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:47,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:21:47,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:21:47,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:21:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:21:47,721 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 18:21:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:21:51,020 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-26 18:21:51,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:21:51,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-10-26 18:21:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:21:51,050 INFO L225 Difference]: With dead ends: 1072 [2018-10-26 18:21:51,050 INFO L226 Difference]: Without dead ends: 762 [2018-10-26 18:21:51,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-26 18:21:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-26 18:21:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-26 18:21:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-26 18:21:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-26 18:21:51,173 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 149 [2018-10-26 18:21:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:21:51,175 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-26 18:21:51,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:21:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-26 18:21:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 18:21:51,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:51,193 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 18:21:51,193 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:51,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1214440191, now seen corresponding path program 1 times [2018-10-26 18:21:51,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:51,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:51,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:21:51,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:51,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:21:51,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:21:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:21:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:21:51,587 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-26 18:21:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:21:54,838 INFO L93 Difference]: Finished difference Result 1917 states and 3253 transitions. [2018-10-26 18:21:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:21:54,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-26 18:21:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:21:54,847 INFO L225 Difference]: With dead ends: 1917 [2018-10-26 18:21:54,847 INFO L226 Difference]: Without dead ends: 1401 [2018-10-26 18:21:54,851 INFO L605 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-10-26 18:21:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-26 18:21:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 933. [2018-10-26 18:21:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-26 18:21:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-26 18:21:54,888 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 155 [2018-10-26 18:21:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:21:54,889 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-26 18:21:54,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:21:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-26 18:21:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 18:21:54,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:54,894 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 18:21:54,894 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:54,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1128204979, now seen corresponding path program 1 times [2018-10-26 18:21:54,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:54,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:21:55,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:55,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:21:55,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:21:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:21:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:21:55,004 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-26 18:21:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:21:57,512 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-26 18:21:57,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:21:57,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-10-26 18:21:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:21:57,523 INFO L225 Difference]: With dead ends: 2699 [2018-10-26 18:21:57,523 INFO L226 Difference]: Without dead ends: 1768 [2018-10-26 18:21:57,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:21:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-26 18:21:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-26 18:21:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-26 18:21:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-26 18:21:57,564 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 158 [2018-10-26 18:21:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:21:57,564 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-26 18:21:57,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:21:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-26 18:21:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 18:21:57,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:57,570 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-26 18:21:57,571 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:57,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1150975335, now seen corresponding path program 1 times [2018-10-26 18:21:57,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 18:21:57,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:21:57,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:21:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:21:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:21:57,696 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-26 18:21:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:21:58,979 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-26 18:21:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:21:58,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-10-26 18:21:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:21:58,995 INFO L225 Difference]: With dead ends: 4329 [2018-10-26 18:21:58,995 INFO L226 Difference]: Without dead ends: 2580 [2018-10-26 18:21:58,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:21:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-26 18:21:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-26 18:21:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-26 18:21:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-26 18:21:59,058 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 166 [2018-10-26 18:21:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:21:59,059 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-26 18:21:59,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:21:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-26 18:21:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 18:21:59,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:59,065 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:21:59,065 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:59,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash -687490482, now seen corresponding path program 1 times [2018-10-26 18:21:59,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:59,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:59,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:59,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:59,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 18:21:59,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:59,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:21:59,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:21:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:21:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:21:59,217 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-26 18:21:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:21:59,855 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-26 18:21:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:21:59,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-26 18:21:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:21:59,876 INFO L225 Difference]: With dead ends: 7713 [2018-10-26 18:21:59,876 INFO L226 Difference]: Without dead ends: 5136 [2018-10-26 18:21:59,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:21:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-26 18:21:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-26 18:21:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-26 18:21:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-26 18:21:59,973 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 172 [2018-10-26 18:21:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:21:59,974 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-26 18:21:59,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:21:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-26 18:21:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 18:21:59,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:59,983 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-26 18:21:59,983 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:59,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash 541571989, now seen corresponding path program 1 times [2018-10-26 18:21:59,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:59,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:59,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:59,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:59,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 18:22:00,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:22:00,344 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 18:22:00,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:00,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:22:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 18:22:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:22:00,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 18:22:00,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:00,668 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-26 18:22:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:03,812 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-26 18:22:03,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:03,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-26 18:22:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:03,888 INFO L225 Difference]: With dead ends: 20487 [2018-10-26 18:22:03,889 INFO L226 Difference]: Without dead ends: 15356 [2018-10-26 18:22:03,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-26 18:22:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-26 18:22:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-26 18:22:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-26 18:22:04,145 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 181 [2018-10-26 18:22:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:04,145 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-26 18:22:04,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-26 18:22:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 18:22:04,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:04,159 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:04,160 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:04,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash -387527722, now seen corresponding path program 1 times [2018-10-26 18:22:04,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:04,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:04,685 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 18:22:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:22:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:22:04,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 18:22:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 18:22:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 18:22:04,723 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-26 18:22:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:07,341 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-26 18:22:07,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 18:22:07,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2018-10-26 18:22:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:07,373 INFO L225 Difference]: With dead ends: 23029 [2018-10-26 18:22:07,373 INFO L226 Difference]: Without dead ends: 12802 [2018-10-26 18:22:07,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10-26 18:22:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-26 18:22:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-26 18:22:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-26 18:22:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-26 18:22:07,606 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 189 [2018-10-26 18:22:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:07,606 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-26 18:22:07,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 18:22:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-26 18:22:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 18:22:07,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:07,623 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:07,624 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:07,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1239035318, now seen corresponding path program 1 times [2018-10-26 18:22:07,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:07,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:07,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:07,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:08,263 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-26 18:22:08,513 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 18:22:08,837 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-26 18:22:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:22:08,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:22:08,880 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 18:22:08,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:09,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:22:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 18:22:09,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:22:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 18:22:09,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 18:22:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 18:22:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 18:22:09,201 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 7 states. [2018-10-26 18:22:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:16,377 INFO L93 Difference]: Finished difference Result 58087 states and 84612 transitions. [2018-10-26 18:22:16,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 18:22:16,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-10-26 18:22:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:16,480 INFO L225 Difference]: With dead ends: 58087 [2018-10-26 18:22:16,480 INFO L226 Difference]: Without dead ends: 47044 [2018-10-26 18:22:16,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 18:22:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47044 states. [2018-10-26 18:22:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47044 to 45802. [2018-10-26 18:22:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45802 states. [2018-10-26 18:22:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45802 states to 45802 states and 56728 transitions. [2018-10-26 18:22:17,128 INFO L78 Accepts]: Start accepts. Automaton has 45802 states and 56728 transitions. Word has length 199 [2018-10-26 18:22:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:17,128 INFO L481 AbstractCegarLoop]: Abstraction has 45802 states and 56728 transitions. [2018-10-26 18:22:17,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 18:22:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45802 states and 56728 transitions. [2018-10-26 18:22:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 18:22:17,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:17,168 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 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] [2018-10-26 18:22:17,168 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:17,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:17,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1403738294, now seen corresponding path program 1 times [2018-10-26 18:22:17,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:17,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:17,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 18:22:17,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:17,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:17,311 INFO L87 Difference]: Start difference. First operand 45802 states and 56728 transitions. Second operand 3 states. [2018-10-26 18:22:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:19,040 INFO L93 Difference]: Finished difference Result 105278 states and 132483 transitions. [2018-10-26 18:22:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:19,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-26 18:22:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:19,156 INFO L225 Difference]: With dead ends: 105278 [2018-10-26 18:22:19,156 INFO L226 Difference]: Without dead ends: 59478 [2018-10-26 18:22:19,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59478 states. [2018-10-26 18:22:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59478 to 59470. [2018-10-26 18:22:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59470 states. [2018-10-26 18:22:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59470 states to 59470 states and 70980 transitions. [2018-10-26 18:22:19,966 INFO L78 Accepts]: Start accepts. Automaton has 59470 states and 70980 transitions. Word has length 211 [2018-10-26 18:22:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:19,967 INFO L481 AbstractCegarLoop]: Abstraction has 59470 states and 70980 transitions. [2018-10-26 18:22:19,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 59470 states and 70980 transitions. [2018-10-26 18:22:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-26 18:22:20,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:20,007 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:20,007 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:20,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash -423272014, now seen corresponding path program 1 times [2018-10-26 18:22:20,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:20,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:20,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:20,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:20,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 18:22:20,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:20,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:22:20,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:20,550 INFO L87 Difference]: Start difference. First operand 59470 states and 70980 transitions. Second operand 3 states. [2018-10-26 18:22:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:21,610 INFO L93 Difference]: Finished difference Result 116382 states and 139036 transitions. [2018-10-26 18:22:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:21,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2018-10-26 18:22:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:21,718 INFO L225 Difference]: With dead ends: 116382 [2018-10-26 18:22:21,718 INFO L226 Difference]: Without dead ends: 56914 [2018-10-26 18:22:21,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56914 states. [2018-10-26 18:22:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56914 to 56914. [2018-10-26 18:22:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56914 states. [2018-10-26 18:22:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56914 states to 56914 states and 66991 transitions. [2018-10-26 18:22:22,365 INFO L78 Accepts]: Start accepts. Automaton has 56914 states and 66991 transitions. Word has length 232 [2018-10-26 18:22:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:22,366 INFO L481 AbstractCegarLoop]: Abstraction has 56914 states and 66991 transitions. [2018-10-26 18:22:22,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 56914 states and 66991 transitions. [2018-10-26 18:22:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-26 18:22:22,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:22,390 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:22,391 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:22,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:22,391 INFO L82 PathProgramCache]: Analyzing trace with hash 65700242, now seen corresponding path program 1 times [2018-10-26 18:22:22,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:22,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:22,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 18:22:22,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:22,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:22,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:22,644 INFO L87 Difference]: Start difference. First operand 56914 states and 66991 transitions. Second operand 4 states. [2018-10-26 18:22:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:24,888 INFO L93 Difference]: Finished difference Result 164183 states and 193655 transitions. [2018-10-26 18:22:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:24,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-10-26 18:22:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:25,047 INFO L225 Difference]: With dead ends: 164183 [2018-10-26 18:22:25,047 INFO L226 Difference]: Without dead ends: 107271 [2018-10-26 18:22:25,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107271 states. [2018-10-26 18:22:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107271 to 107269. [2018-10-26 18:22:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107269 states. [2018-10-26 18:22:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107269 states to 107269 states and 126518 transitions. [2018-10-26 18:22:26,338 INFO L78 Accepts]: Start accepts. Automaton has 107269 states and 126518 transitions. Word has length 252 [2018-10-26 18:22:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:26,338 INFO L481 AbstractCegarLoop]: Abstraction has 107269 states and 126518 transitions. [2018-10-26 18:22:26,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 107269 states and 126518 transitions. [2018-10-26 18:22:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-26 18:22:26,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:26,358 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:22:26,359 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:26,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:26,359 INFO L82 PathProgramCache]: Analyzing trace with hash -508054516, now seen corresponding path program 1 times [2018-10-26 18:22:26,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:26,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:26,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:26,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 18:22:26,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:26,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:26,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:26,628 INFO L87 Difference]: Start difference. First operand 107269 states and 126518 transitions. Second operand 4 states. [2018-10-26 18:22:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:30,232 INFO L93 Difference]: Finished difference Result 342982 states and 403342 transitions. [2018-10-26 18:22:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:30,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-10-26 18:22:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:30,527 INFO L225 Difference]: With dead ends: 342982 [2018-10-26 18:22:30,528 INFO L226 Difference]: Without dead ends: 235715 [2018-10-26 18:22:30,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235715 states. [2018-10-26 18:22:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235715 to 176416. [2018-10-26 18:22:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176416 states. [2018-10-26 18:22:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176416 states to 176416 states and 206181 transitions. [2018-10-26 18:22:32,718 INFO L78 Accepts]: Start accepts. Automaton has 176416 states and 206181 transitions. Word has length 290 [2018-10-26 18:22:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:32,718 INFO L481 AbstractCegarLoop]: Abstraction has 176416 states and 206181 transitions. [2018-10-26 18:22:32,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 176416 states and 206181 transitions. [2018-10-26 18:22:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-26 18:22:33,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:33,614 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:33,614 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:33,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 181568895, now seen corresponding path program 1 times [2018-10-26 18:22:33,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:33,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 18:22:33,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:33,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:22:33,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:33,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:33,911 INFO L87 Difference]: Start difference. First operand 176416 states and 206181 transitions. Second operand 3 states. [2018-10-26 18:22:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:36,079 INFO L93 Difference]: Finished difference Result 492155 states and 576041 transitions. [2018-10-26 18:22:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:36,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-10-26 18:22:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:36,496 INFO L225 Difference]: With dead ends: 492155 [2018-10-26 18:22:36,497 INFO L226 Difference]: Without dead ends: 315741 [2018-10-26 18:22:36,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315741 states. [2018-10-26 18:22:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315741 to 315735. [2018-10-26 18:22:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315735 states. [2018-10-26 18:22:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315735 states to 315735 states and 369658 transitions. [2018-10-26 18:22:41,467 INFO L78 Accepts]: Start accepts. Automaton has 315735 states and 369658 transitions. Word has length 303 [2018-10-26 18:22:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:41,467 INFO L481 AbstractCegarLoop]: Abstraction has 315735 states and 369658 transitions. [2018-10-26 18:22:41,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 315735 states and 369658 transitions. [2018-10-26 18:22:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-26 18:22:41,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:41,512 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:22:41,512 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:41,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash -839453957, now seen corresponding path program 1 times [2018-10-26 18:22:41,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:41,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 200 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 18:22:41,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:22:41,905 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 18:22:41,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:42,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:22:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 18:22:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:22:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 18:22:42,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 18:22:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 18:22:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 18:22:42,297 INFO L87 Difference]: Start difference. First operand 315735 states and 369658 transitions. Second operand 5 states. [2018-10-26 18:22:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:49,438 INFO L93 Difference]: Finished difference Result 648344 states and 761187 transitions. [2018-10-26 18:22:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:49,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 311 [2018-10-26 18:22:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:49,949 INFO L225 Difference]: With dead ends: 648344 [2018-10-26 18:22:49,950 INFO L226 Difference]: Without dead ends: 332611 [2018-10-26 18:22:50,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 18:22:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332611 states. [2018-10-26 18:23:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332611 to 317091. [2018-10-26 18:23:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317091 states. [2018-10-26 18:23:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317091 states to 317091 states and 367632 transitions. [2018-10-26 18:23:01,558 INFO L78 Accepts]: Start accepts. Automaton has 317091 states and 367632 transitions. Word has length 311 [2018-10-26 18:23:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:01,559 INFO L481 AbstractCegarLoop]: Abstraction has 317091 states and 367632 transitions. [2018-10-26 18:23:01,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 18:23:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 317091 states and 367632 transitions. [2018-10-26 18:23:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-26 18:23:01,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:01,600 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:23:01,600 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:01,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 491571747, now seen corresponding path program 1 times [2018-10-26 18:23:01,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-10-26 18:23:01,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:23:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:23:01,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:23:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:23:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:23:01,839 INFO L87 Difference]: Start difference. First operand 317091 states and 367632 transitions. Second operand 3 states. [2018-10-26 18:23:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:05,414 INFO L93 Difference]: Finished difference Result 634164 states and 735246 transitions. [2018-10-26 18:23:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:23:05,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-10-26 18:23:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:23:05,941 INFO L225 Difference]: With dead ends: 634164 [2018-10-26 18:23:05,941 INFO L226 Difference]: Without dead ends: 317075 [2018-10-26 18:23:06,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:23:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317075 states. [2018-10-26 18:23:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317075 to 317075. [2018-10-26 18:23:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317075 states. [2018-10-26 18:23:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317075 states to 317075 states and 367600 transitions. [2018-10-26 18:23:13,714 INFO L78 Accepts]: Start accepts. Automaton has 317075 states and 367600 transitions. Word has length 342 [2018-10-26 18:23:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:13,714 INFO L481 AbstractCegarLoop]: Abstraction has 317075 states and 367600 transitions. [2018-10-26 18:23:13,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:23:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 317075 states and 367600 transitions. [2018-10-26 18:23:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-26 18:23:13,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:13,767 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:23:13,768 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:13,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash 977755767, now seen corresponding path program 1 times [2018-10-26 18:23:13,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:13,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-26 18:23:14,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:23:14,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:23:14,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:23:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:23:14,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:23:14,027 INFO L87 Difference]: Start difference. First operand 317075 states and 367600 transitions. Second operand 3 states. [2018-10-26 18:23:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:19,134 INFO L93 Difference]: Finished difference Result 600564 states and 695026 transitions. [2018-10-26 18:23:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:23:19,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-10-26 18:23:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:23:19,540 INFO L225 Difference]: With dead ends: 600564 [2018-10-26 18:23:19,541 INFO L226 Difference]: Without dead ends: 283491 [2018-10-26 18:23:19,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:23:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283491 states. [2018-10-26 18:23:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283491 to 283483. [2018-10-26 18:23:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283483 states. [2018-10-26 18:23:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283483 states to 283483 states and 315764 transitions. [2018-10-26 18:23:30,492 INFO L78 Accepts]: Start accepts. Automaton has 283483 states and 315764 transitions. Word has length 351 [2018-10-26 18:23:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:30,493 INFO L481 AbstractCegarLoop]: Abstraction has 283483 states and 315764 transitions. [2018-10-26 18:23:30,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:23:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 283483 states and 315764 transitions. [2018-10-26 18:23:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-26 18:23:30,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:30,532 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:23:30,533 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:30,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash -272507335, now seen corresponding path program 1 times [2018-10-26 18:23:30,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:30,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:30,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:30,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:30,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-10-26 18:23:30,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:23:30,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:23:30,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:23:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:23:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:23:30,908 INFO L87 Difference]: Start difference. First operand 283483 states and 315764 transitions. Second operand 4 states. [2018-10-26 18:23:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:36,116 INFO L93 Difference]: Finished difference Result 565808 states and 630708 transitions. [2018-10-26 18:23:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:23:36,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-10-26 18:23:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:23:36,465 INFO L225 Difference]: With dead ends: 565808 [2018-10-26 18:23:36,465 INFO L226 Difference]: Without dead ends: 282327 [2018-10-26 18:23:36,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-26 18:23:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282327 states. [2018-10-26 18:23:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282327 to 278993. [2018-10-26 18:23:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278993 states. [2018-10-26 18:23:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278993 states to 278993 states and 307155 transitions. [2018-10-26 18:23:41,674 INFO L78 Accepts]: Start accepts. Automaton has 278993 states and 307155 transitions. Word has length 358 [2018-10-26 18:23:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:41,675 INFO L481 AbstractCegarLoop]: Abstraction has 278993 states and 307155 transitions. [2018-10-26 18:23:41,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:23:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 278993 states and 307155 transitions. [2018-10-26 18:23:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-26 18:23:41,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:41,716 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:23:41,716 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:41,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1584353577, now seen corresponding path program 1 times [2018-10-26 18:23:41,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-26 18:23:42,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:23:42,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:23:42,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:23:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:23:42,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:23:42,101 INFO L87 Difference]: Start difference. First operand 278993 states and 307155 transitions. Second operand 4 states. [2018-10-26 18:23:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:44,987 INFO L93 Difference]: Finished difference Result 524999 states and 577635 transitions. [2018-10-26 18:23:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:23:44,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-26 18:23:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:23:46,593 INFO L225 Difference]: With dead ends: 524999 [2018-10-26 18:23:46,593 INFO L226 Difference]: Without dead ends: 246008 [2018-10-26 18:23:46,706 INFO L605 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-10-26 18:23:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246008 states. [2018-10-26 18:23:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246008 to 245992. [2018-10-26 18:23:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245992 states. [2018-10-26 18:23:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245992 states to 245992 states and 266429 transitions. [2018-10-26 18:23:50,215 INFO L78 Accepts]: Start accepts. Automaton has 245992 states and 266429 transitions. Word has length 371 [2018-10-26 18:23:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:50,216 INFO L481 AbstractCegarLoop]: Abstraction has 245992 states and 266429 transitions. [2018-10-26 18:23:50,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:23:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 245992 states and 266429 transitions. [2018-10-26 18:23:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-26 18:23:50,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:50,301 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-26 18:23:50,301 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:50,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1548582743, now seen corresponding path program 1 times [2018-10-26 18:23:50,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:50,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:50,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-26 18:23:50,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:23:50,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:23:50,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:23:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:23:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:23:50,786 INFO L87 Difference]: Start difference. First operand 245992 states and 266429 transitions. Second operand 4 states. [2018-10-26 18:23:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:54,980 INFO L93 Difference]: Finished difference Result 488924 states and 529642 transitions. [2018-10-26 18:23:54,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:23:54,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 464 [2018-10-26 18:23:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:23:55,303 INFO L225 Difference]: With dead ends: 488924 [2018-10-26 18:23:55,304 INFO L226 Difference]: Without dead ends: 242934 [2018-10-26 18:23:55,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:23:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242934 states. [2018-10-26 18:23:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242934 to 242918. [2018-10-26 18:23:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242918 states. [2018-10-26 18:23:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242918 states to 242918 states and 260054 transitions. [2018-10-26 18:23:59,125 INFO L78 Accepts]: Start accepts. Automaton has 242918 states and 260054 transitions. Word has length 464 [2018-10-26 18:23:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:59,126 INFO L481 AbstractCegarLoop]: Abstraction has 242918 states and 260054 transitions. [2018-10-26 18:23:59,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:23:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 242918 states and 260054 transitions. [2018-10-26 18:23:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-26 18:23:59,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:59,179 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-26 18:23:59,179 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:59,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1908180572, now seen corresponding path program 1 times [2018-10-26 18:23:59,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:59,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:59,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:24:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 439 proven. 173 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 18:24:05,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:24:05,004 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 18:24:05,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:24:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:24:05,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:24:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 583 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 18:24:06,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 18:24:06,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2018-10-26 18:24:06,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 18:24:06,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 18:24:06,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-26 18:24:06,396 INFO L87 Difference]: Start difference. First operand 242918 states and 260054 transitions. Second operand 14 states. [2018-10-26 18:24:06,617 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-10-26 18:24:08,777 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-10-26 18:24:14,595 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-26 18:24:24,151 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-26 18:24:24,318 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-26 18:24:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:24:32,127 INFO L93 Difference]: Finished difference Result 1246156 states and 1329612 transitions. [2018-10-26 18:24:32,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-26 18:24:32,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 486 [2018-10-26 18:24:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:24:33,648 INFO L225 Difference]: With dead ends: 1246156 [2018-10-26 18:24:33,649 INFO L226 Difference]: Without dead ends: 1003240 [2018-10-26 18:24:33,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=595, Invalid=1661, Unknown=0, NotChecked=0, Total=2256 [2018-10-26 18:24:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003240 states. [2018-10-26 18:24:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003240 to 891046. [2018-10-26 18:24:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891046 states. [2018-10-26 18:24:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891046 states to 891046 states and 953593 transitions. [2018-10-26 18:24:52,442 INFO L78 Accepts]: Start accepts. Automaton has 891046 states and 953593 transitions. Word has length 486 [2018-10-26 18:24:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:24:52,442 INFO L481 AbstractCegarLoop]: Abstraction has 891046 states and 953593 transitions. [2018-10-26 18:24:52,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 18:24:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 891046 states and 953593 transitions. [2018-10-26 18:24:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-26 18:24:52,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:24:52,569 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:24:52,569 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:24:52,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:24:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1489684767, now seen corresponding path program 1 times [2018-10-26 18:24:52,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:24:52,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:24:52,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:24:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:24:52,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:24:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:24:53,006 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 18:24:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 407 proven. 63 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-26 18:24:53,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:24:53,523 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 18:24:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:24:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:24:53,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-10-26 18:25:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-26 18:25:01,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:25:01,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 18:25:01,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 18:25:01,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 18:25:01,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 18:25:01,264 INFO L87 Difference]: Start difference. First operand 891046 states and 953593 transitions. Second operand 9 states. [2018-10-26 18:25:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 18:25:01,266 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 18:25:01,271 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 18:25:01,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 06:25:01 BoogieIcfgContainer [2018-10-26 18:25:01,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 18:25:01,272 INFO L168 Benchmark]: Toolchain (without parser) took 202630.09 ms. Allocated memory was 1.5 GB in the beginning and 6.5 GB in the end (delta: 4.9 GB). Free memory was 1.4 GB in the beginning and 4.5 GB in the end (delta: -3.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-26 18:25:01,273 INFO L168 Benchmark]: CDTParser took 0.25 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-10-26 18:25:01,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1275.80 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:01,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 412.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.9 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:01,275 INFO L168 Benchmark]: Boogie Preprocessor took 174.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:01,276 INFO L168 Benchmark]: RCFGBuilder took 5968.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.7 MB). Peak memory consumption was 256.7 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:01,276 INFO L168 Benchmark]: TraceAbstraction took 194793.67 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 2.0 GB in the beginning and 4.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-26 18:25:01,281 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.25 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 1275.80 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 412.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.9 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 174.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5968.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.7 MB). Peak memory consumption was 256.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194793.67 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 2.0 GB in the beginning and 4.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1479]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (891046states) and FLOYD_HOARE automaton (currently 2 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.7s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 96.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5128 SDtfs, 17025 SDslu, 5200 SDs, 0 SdLazy, 30144 SolverSat, 5399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1785 GetRequests, 1683 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=891046occurred in iteration=20, 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: 71.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 199262 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 7491 NumberOfCodeBlocks, 7491 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7465 ConstructedInterpolants, 0 QuantifiedInterpolants, 12656903 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2961 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 6344/6631 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown