java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:27,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:27,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:27,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:27,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:27,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:27,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:27,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:27,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:27,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:27,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:27,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:27,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:27,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:27,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:27,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:27,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:27,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:27,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:27,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:27,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:27,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:27,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:27,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:27,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:27,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:27,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:27,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:27,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:27,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:27,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:27,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:27,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:27,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:27,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:27,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:27,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:52:27,735 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:27,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:27,736 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:27,736 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:27,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:27,737 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:27,738 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:27,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:27,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:27,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:27,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:27,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:27,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:27,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:27,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:27,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:27,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:27,741 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:27,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:27,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:27,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:27,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:27,742 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:27,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:27,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:27,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:27,743 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:27,743 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:27,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:27,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:27,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:27,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:27,844 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:27,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-11-06 19:52:27,906 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f5df09a/cba9a4b233f64ea6a84c78f5c5d838b9/FLAGa1b1d5c72 [2018-11-06 19:52:28,557 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:28,558 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-11-06 19:52:28,583 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f5df09a/cba9a4b233f64ea6a84c78f5c5d838b9/FLAGa1b1d5c72 [2018-11-06 19:52:28,604 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f5df09a/cba9a4b233f64ea6a84c78f5c5d838b9 [2018-11-06 19:52:28,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:28,618 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:28,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:28,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:28,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:28,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:28" (1/1) ... [2018-11-06 19:52:28,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fd93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:28, skipping insertion in model container [2018-11-06 19:52:28,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:28" (1/1) ... [2018-11-06 19:52:28,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:28,744 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:29,567 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:29,574 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:29,866 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:29,890 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:29,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29 WrapperNode [2018-11-06 19:52:29,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:29,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:29,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:29,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:29,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:30,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:30,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:30,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:30,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... [2018-11-06 19:52:30,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:30,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:30,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:30,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:30,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:35,613 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:35,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:35 BoogieIcfgContainer [2018-11-06 19:52:35,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:35,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:35,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:35,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:35,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:28" (1/3) ... [2018-11-06 19:52:35,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d399ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:35, skipping insertion in model container [2018-11-06 19:52:35,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:29" (2/3) ... [2018-11-06 19:52:35,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d399ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:35, skipping insertion in model container [2018-11-06 19:52:35,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:35" (3/3) ... [2018-11-06 19:52:35,623 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label03_true-unreach-call.c [2018-11-06 19:52:35,634 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:35,643 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:35,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:35,699 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:35,700 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:35,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:35,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:35,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:35,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:35,701 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:35,701 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:35,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-06 19:52:35,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:35,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:35,755 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:35,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:35,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1347359086, now seen corresponding path program 1 times [2018-11-06 19:52:35,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:35,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:35,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:35,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:35,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:36,718 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:52:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:36,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:36,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:36,851 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:40,411 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-11-06 19:52:40,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:40,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-11-06 19:52:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:40,438 INFO L225 Difference]: With dead ends: 1089 [2018-11-06 19:52:40,439 INFO L226 Difference]: Without dead ends: 779 [2018-11-06 19:52:40,444 INFO L604 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-11-06 19:52:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-06 19:52:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-11-06 19:52:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-06 19:52:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-11-06 19:52:40,544 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 165 [2018-11-06 19:52:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:40,545 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-11-06 19:52:40,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-11-06 19:52:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-06 19:52:40,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:40,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:40,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:40,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash 751655233, now seen corresponding path program 1 times [2018-11-06 19:52:40,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:40,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:40,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:40,760 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-11-06 19:52:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:40,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:40,844 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-11-06 19:52:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:45,295 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-11-06 19:52:45,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:45,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-11-06 19:52:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:45,313 INFO L225 Difference]: With dead ends: 1904 [2018-11-06 19:52:45,313 INFO L226 Difference]: Without dead ends: 1391 [2018-11-06 19:52:45,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-06 19:52:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-11-06 19:52:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-11-06 19:52:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-11-06 19:52:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-11-06 19:52:45,350 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 171 [2018-11-06 19:52:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:45,350 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-11-06 19:52:45,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-11-06 19:52:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-06 19:52:45,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:45,362 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:45,362 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:45,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash -942218426, now seen corresponding path program 1 times [2018-11-06 19:52:45,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:45,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:45,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:45,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:45,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:45,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:45,496 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-11-06 19:52:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:47,319 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-11-06 19:52:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:47,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-11-06 19:52:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:47,330 INFO L225 Difference]: With dead ends: 2711 [2018-11-06 19:52:47,330 INFO L226 Difference]: Without dead ends: 1786 [2018-11-06 19:52:47,332 INFO L604 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-11-06 19:52:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-11-06 19:52:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-11-06 19:52:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-11-06 19:52:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-11-06 19:52:47,383 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 172 [2018-11-06 19:52:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:47,384 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-11-06 19:52:47,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-11-06 19:52:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-06 19:52:47,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:47,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:47,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:47,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1357798669, now seen corresponding path program 1 times [2018-11-06 19:52:47,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:47,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:47,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:47,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:47,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:47,538 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-11-06 19:52:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:48,991 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-11-06 19:52:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:49,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-06 19:52:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:49,017 INFO L225 Difference]: With dead ends: 5215 [2018-11-06 19:52:49,017 INFO L226 Difference]: Without dead ends: 3433 [2018-11-06 19:52:49,021 INFO L604 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-11-06 19:52:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-11-06 19:52:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-11-06 19:52:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-11-06 19:52:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-11-06 19:52:49,104 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 174 [2018-11-06 19:52:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:49,104 INFO L480 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-11-06 19:52:49,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-11-06 19:52:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-06 19:52:49,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:49,113 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:49,113 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:49,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1216147553, now seen corresponding path program 1 times [2018-11-06 19:52:49,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:49,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:49,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:49,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:49,539 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-11-06 19:52:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:51,170 INFO L93 Difference]: Finished difference Result 6836 states and 10274 transitions. [2018-11-06 19:52:51,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:51,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-11-06 19:52:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:51,187 INFO L225 Difference]: With dead ends: 6836 [2018-11-06 19:52:51,187 INFO L226 Difference]: Without dead ends: 3422 [2018-11-06 19:52:51,192 INFO L604 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-11-06 19:52:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2018-11-06 19:52:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3416. [2018-11-06 19:52:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-11-06 19:52:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 4798 transitions. [2018-11-06 19:52:51,256 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 4798 transitions. Word has length 182 [2018-11-06 19:52:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:51,257 INFO L480 AbstractCegarLoop]: Abstraction has 3416 states and 4798 transitions. [2018-11-06 19:52:51,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4798 transitions. [2018-11-06 19:52:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:52:51,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:51,266 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:51,266 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:51,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash -50533991, now seen corresponding path program 1 times [2018-11-06 19:52:51,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:51,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:51,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:51,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:51,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:51,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:51,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:51,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:51,414 INFO L87 Difference]: Start difference. First operand 3416 states and 4798 transitions. Second operand 3 states. [2018-11-06 19:52:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:53,009 INFO L93 Difference]: Finished difference Result 10097 states and 14225 transitions. [2018-11-06 19:52:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:53,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-06 19:52:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:53,031 INFO L225 Difference]: With dead ends: 10097 [2018-11-06 19:52:53,032 INFO L226 Difference]: Without dead ends: 6683 [2018-11-06 19:52:53,037 INFO L604 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-11-06 19:52:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2018-11-06 19:52:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6681. [2018-11-06 19:52:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6681 states. [2018-11-06 19:52:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 8561 transitions. [2018-11-06 19:52:53,147 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 8561 transitions. Word has length 189 [2018-11-06 19:52:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:53,148 INFO L480 AbstractCegarLoop]: Abstraction has 6681 states and 8561 transitions. [2018-11-06 19:52:53,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 8561 transitions. [2018-11-06 19:52:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:52:53,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:53,158 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:53,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:53,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1485224914, now seen corresponding path program 1 times [2018-11-06 19:52:53,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:53,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:53,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:53,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:53,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:53,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:53,323 INFO L87 Difference]: Start difference. First operand 6681 states and 8561 transitions. Second operand 4 states. [2018-11-06 19:52:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:55,846 INFO L93 Difference]: Finished difference Result 26271 states and 33635 transitions. [2018-11-06 19:52:55,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:55,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-06 19:52:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:55,908 INFO L225 Difference]: With dead ends: 26271 [2018-11-06 19:52:55,909 INFO L226 Difference]: Without dead ends: 19592 [2018-11-06 19:52:55,922 INFO L604 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-11-06 19:52:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19592 states. [2018-11-06 19:52:56,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19592 to 13007. [2018-11-06 19:52:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-11-06 19:52:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 16047 transitions. [2018-11-06 19:52:56,257 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 16047 transitions. Word has length 189 [2018-11-06 19:52:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:56,257 INFO L480 AbstractCegarLoop]: Abstraction has 13007 states and 16047 transitions. [2018-11-06 19:52:56,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 16047 transitions. [2018-11-06 19:52:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-06 19:52:56,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:56,279 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:56,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:56,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash -974747267, now seen corresponding path program 1 times [2018-11-06 19:52:56,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:56,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:56,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 19:52:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:56,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:56,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:56,401 INFO L87 Difference]: Start difference. First operand 13007 states and 16047 transitions. Second operand 3 states. [2018-11-06 19:52:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:57,345 INFO L93 Difference]: Finished difference Result 25980 states and 32049 transitions. [2018-11-06 19:52:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:57,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-11-06 19:52:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:57,370 INFO L225 Difference]: With dead ends: 25980 [2018-11-06 19:52:57,371 INFO L226 Difference]: Without dead ends: 12975 [2018-11-06 19:52:57,384 INFO L604 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-11-06 19:52:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-11-06 19:52:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 12975. [2018-11-06 19:52:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12975 states. [2018-11-06 19:52:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 15735 transitions. [2018-11-06 19:52:57,542 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 15735 transitions. Word has length 227 [2018-11-06 19:52:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:57,542 INFO L480 AbstractCegarLoop]: Abstraction has 12975 states and 15735 transitions. [2018-11-06 19:52:57,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 15735 transitions. [2018-11-06 19:52:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-06 19:52:57,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:57,560 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:52:57,561 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:57,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1948082637, now seen corresponding path program 1 times [2018-11-06 19:52:57,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:57,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:57,885 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:52:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:57,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:57,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:57,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:57,932 INFO L87 Difference]: Start difference. First operand 12975 states and 15735 transitions. Second operand 4 states. [2018-11-06 19:53:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:00,221 INFO L93 Difference]: Finished difference Result 30643 states and 37689 transitions. [2018-11-06 19:53:00,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:00,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-11-06 19:53:00,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:00,260 INFO L225 Difference]: With dead ends: 30643 [2018-11-06 19:53:00,260 INFO L226 Difference]: Without dead ends: 17670 [2018-11-06 19:53:00,274 INFO L604 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-11-06 19:53:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2018-11-06 19:53:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17667. [2018-11-06 19:53:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-11-06 19:53:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 20516 transitions. [2018-11-06 19:53:00,481 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 20516 transitions. Word has length 230 [2018-11-06 19:53:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:00,481 INFO L480 AbstractCegarLoop]: Abstraction has 17667 states and 20516 transitions. [2018-11-06 19:53:00,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 20516 transitions. [2018-11-06 19:53:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-06 19:53:00,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:00,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:00,504 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:00,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1958712054, now seen corresponding path program 1 times [2018-11-06 19:53:00,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:00,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:00,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:00,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:00,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:00,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:00,823 INFO L87 Difference]: Start difference. First operand 17667 states and 20516 transitions. Second operand 3 states. [2018-11-06 19:53:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:02,020 INFO L93 Difference]: Finished difference Result 34923 states and 40585 transitions. [2018-11-06 19:53:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:02,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-11-06 19:53:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:02,039 INFO L225 Difference]: With dead ends: 34923 [2018-11-06 19:53:02,039 INFO L226 Difference]: Without dead ends: 17258 [2018-11-06 19:53:02,056 INFO L604 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-11-06 19:53:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17258 states. [2018-11-06 19:53:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17258 to 17257. [2018-11-06 19:53:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17257 states. [2018-11-06 19:53:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17257 states to 17257 states and 19455 transitions. [2018-11-06 19:53:02,257 INFO L78 Accepts]: Start accepts. Automaton has 17257 states and 19455 transitions. Word has length 256 [2018-11-06 19:53:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:02,257 INFO L480 AbstractCegarLoop]: Abstraction has 17257 states and 19455 transitions. [2018-11-06 19:53:02,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 17257 states and 19455 transitions. [2018-11-06 19:53:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-06 19:53:02,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:02,281 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:02,282 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:02,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2046103689, now seen corresponding path program 1 times [2018-11-06 19:53:02,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:02,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:02,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 19:53:02,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:02,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:02,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:02,728 INFO L87 Difference]: Start difference. First operand 17257 states and 19455 transitions. Second operand 5 states. [2018-11-06 19:53:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:05,158 INFO L93 Difference]: Finished difference Result 52355 states and 58792 transitions. [2018-11-06 19:53:05,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:05,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-11-06 19:53:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:05,190 INFO L225 Difference]: With dead ends: 52355 [2018-11-06 19:53:05,190 INFO L226 Difference]: Without dead ends: 35100 [2018-11-06 19:53:05,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35100 states. [2018-11-06 19:53:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35100 to 35095. [2018-11-06 19:53:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35095 states. [2018-11-06 19:53:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35095 states to 35095 states and 39310 transitions. [2018-11-06 19:53:05,639 INFO L78 Accepts]: Start accepts. Automaton has 35095 states and 39310 transitions. Word has length 266 [2018-11-06 19:53:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:05,640 INFO L480 AbstractCegarLoop]: Abstraction has 35095 states and 39310 transitions. [2018-11-06 19:53:05,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 35095 states and 39310 transitions. [2018-11-06 19:53:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-06 19:53:05,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:05,665 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:05,665 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:05,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash 646529718, now seen corresponding path program 1 times [2018-11-06 19:53:05,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:05,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-06 19:53:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:06,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:06,270 INFO L87 Difference]: Start difference. First operand 35095 states and 39310 transitions. Second operand 4 states. [2018-11-06 19:53:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:07,730 INFO L93 Difference]: Finished difference Result 69313 states and 77621 transitions. [2018-11-06 19:53:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:07,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-06 19:53:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:07,763 INFO L225 Difference]: With dead ends: 69313 [2018-11-06 19:53:07,764 INFO L226 Difference]: Without dead ends: 34220 [2018-11-06 19:53:07,784 INFO L604 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-11-06 19:53:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34220 states. [2018-11-06 19:53:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34220 to 34220. [2018-11-06 19:53:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34220 states. [2018-11-06 19:53:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34220 states to 34220 states and 37008 transitions. [2018-11-06 19:53:08,137 INFO L78 Accepts]: Start accepts. Automaton has 34220 states and 37008 transitions. Word has length 267 [2018-11-06 19:53:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:08,137 INFO L480 AbstractCegarLoop]: Abstraction has 34220 states and 37008 transitions. [2018-11-06 19:53:08,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34220 states and 37008 transitions. [2018-11-06 19:53:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-06 19:53:08,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:08,146 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:08,147 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:08,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1794947131, now seen corresponding path program 1 times [2018-11-06 19:53:08,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:08,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:08,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-06 19:53:08,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:08,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:08,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:08,422 INFO L87 Difference]: Start difference. First operand 34220 states and 37008 transitions. Second operand 4 states. [2018-11-06 19:53:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:10,689 INFO L93 Difference]: Finished difference Result 120696 states and 130174 transitions. [2018-11-06 19:53:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:10,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-11-06 19:53:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:10,772 INFO L225 Difference]: With dead ends: 120696 [2018-11-06 19:53:10,772 INFO L226 Difference]: Without dead ends: 86478 [2018-11-06 19:53:10,804 INFO L604 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-11-06 19:53:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86478 states. [2018-11-06 19:53:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86478 to 86474. [2018-11-06 19:53:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86474 states. [2018-11-06 19:53:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86474 states to 86474 states and 93054 transitions. [2018-11-06 19:53:12,001 INFO L78 Accepts]: Start accepts. Automaton has 86474 states and 93054 transitions. Word has length 269 [2018-11-06 19:53:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:12,001 INFO L480 AbstractCegarLoop]: Abstraction has 86474 states and 93054 transitions. [2018-11-06 19:53:12,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 86474 states and 93054 transitions. [2018-11-06 19:53:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-06 19:53:12,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:12,011 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:12,011 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:12,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:12,012 INFO L82 PathProgramCache]: Analyzing trace with hash 74302533, now seen corresponding path program 1 times [2018-11-06 19:53:12,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:12,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:12,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:12,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-06 19:53:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:12,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:12,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:12,235 INFO L87 Difference]: Start difference. First operand 86474 states and 93054 transitions. Second operand 3 states. [2018-11-06 19:53:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:14,511 INFO L93 Difference]: Finished difference Result 172943 states and 186103 transitions. [2018-11-06 19:53:14,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:14,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-11-06 19:53:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:14,598 INFO L225 Difference]: With dead ends: 172943 [2018-11-06 19:53:14,598 INFO L226 Difference]: Without dead ends: 86471 [2018-11-06 19:53:14,649 INFO L604 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-11-06 19:53:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86471 states. [2018-11-06 19:53:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86471 to 86471. [2018-11-06 19:53:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86471 states. [2018-11-06 19:53:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86471 states to 86471 states and 93048 transitions. [2018-11-06 19:53:16,438 INFO L78 Accepts]: Start accepts. Automaton has 86471 states and 93048 transitions. Word has length 298 [2018-11-06 19:53:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:16,438 INFO L480 AbstractCegarLoop]: Abstraction has 86471 states and 93048 transitions. [2018-11-06 19:53:16,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 86471 states and 93048 transitions. [2018-11-06 19:53:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-06 19:53:16,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:16,449 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:16,449 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:16,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1488256468, now seen corresponding path program 1 times [2018-11-06 19:53:16,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-06 19:53:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:16,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:16,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:16,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:16,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:16,633 INFO L87 Difference]: Start difference. First operand 86471 states and 93048 transitions. Second operand 3 states. [2018-11-06 19:53:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:18,393 INFO L93 Difference]: Finished difference Result 214956 states and 231088 transitions. [2018-11-06 19:53:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:18,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-11-06 19:53:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:18,548 INFO L225 Difference]: With dead ends: 214956 [2018-11-06 19:53:18,548 INFO L226 Difference]: Without dead ends: 128487 [2018-11-06 19:53:18,607 INFO L604 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-11-06 19:53:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128487 states. [2018-11-06 19:53:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128487 to 125606. [2018-11-06 19:53:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125606 states. [2018-11-06 19:53:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125606 states to 125606 states and 134938 transitions. [2018-11-06 19:53:21,027 INFO L78 Accepts]: Start accepts. Automaton has 125606 states and 134938 transitions. Word has length 303 [2018-11-06 19:53:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:21,027 INFO L480 AbstractCegarLoop]: Abstraction has 125606 states and 134938 transitions. [2018-11-06 19:53:21,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 125606 states and 134938 transitions. [2018-11-06 19:53:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-06 19:53:21,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:21,044 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:21,045 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:21,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2106864431, now seen corresponding path program 1 times [2018-11-06 19:53:21,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:22,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:22,414 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:53:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:22,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:22,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:53:22,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 12 [2018-11-06 19:53:22,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 19:53:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 19:53:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:53:22,901 INFO L87 Difference]: Start difference. First operand 125606 states and 134938 transitions. Second operand 13 states. [2018-11-06 19:53:24,956 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-11-06 19:53:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:40,800 INFO L93 Difference]: Finished difference Result 557987 states and 598038 transitions. [2018-11-06 19:53:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-06 19:53:40,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2018-11-06 19:53:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:41,514 INFO L225 Difference]: With dead ends: 557987 [2018-11-06 19:53:41,514 INFO L226 Difference]: Without dead ends: 432383 [2018-11-06 19:53:41,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 19:53:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432383 states. [2018-11-06 19:53:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432383 to 410123. [2018-11-06 19:53:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410123 states. [2018-11-06 19:53:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410123 states to 410123 states and 436941 transitions. [2018-11-06 19:53:50,445 INFO L78 Accepts]: Start accepts. Automaton has 410123 states and 436941 transitions. Word has length 305 [2018-11-06 19:53:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:50,445 INFO L480 AbstractCegarLoop]: Abstraction has 410123 states and 436941 transitions. [2018-11-06 19:53:50,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 19:53:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 410123 states and 436941 transitions. [2018-11-06 19:53:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-06 19:53:50,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:50,518 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:50,518 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:50,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1554377472, now seen corresponding path program 1 times [2018-11-06 19:53:50,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:50,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:50,864 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:53:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-06 19:53:51,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:51,062 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:53:51,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:51,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-06 19:53:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:51,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:53:51,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:51,514 INFO L87 Difference]: Start difference. First operand 410123 states and 436941 transitions. Second operand 6 states. [2018-11-06 19:54:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:08,232 INFO L93 Difference]: Finished difference Result 1145138 states and 1224839 transitions. [2018-11-06 19:54:08,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:54:08,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 311 [2018-11-06 19:54:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:09,209 INFO L225 Difference]: With dead ends: 1145138 [2018-11-06 19:54:09,210 INFO L226 Difference]: Without dead ends: 735631 [2018-11-06 19:54:09,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:54:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735631 states. [2018-11-06 19:54:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735631 to 687423. [2018-11-06 19:54:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687423 states. [2018-11-06 19:54:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687423 states to 687423 states and 729815 transitions. [2018-11-06 19:54:21,561 INFO L78 Accepts]: Start accepts. Automaton has 687423 states and 729815 transitions. Word has length 311 [2018-11-06 19:54:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:21,561 INFO L480 AbstractCegarLoop]: Abstraction has 687423 states and 729815 transitions. [2018-11-06 19:54:21,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:54:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 687423 states and 729815 transitions. [2018-11-06 19:54:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-06 19:54:21,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:21,624 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:54:21,625 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:21,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1662920129, now seen corresponding path program 1 times [2018-11-06 19:54:21,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:21,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:21,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:21,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:21,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-06 19:54:22,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:22,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:54:22,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:22,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:22,063 INFO L87 Difference]: Start difference. First operand 687423 states and 729815 transitions. Second operand 4 states. [2018-11-06 19:54:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:38,247 INFO L93 Difference]: Finished difference Result 1357273 states and 1441898 transitions. [2018-11-06 19:54:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:38,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-11-06 19:54:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:39,194 INFO L225 Difference]: With dead ends: 1357273 [2018-11-06 19:54:39,195 INFO L226 Difference]: Without dead ends: 670466 [2018-11-06 19:54:39,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-06 19:54:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670466 states. [2018-11-06 19:54:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670466 to 662624. [2018-11-06 19:54:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662624 states. [2018-11-06 19:54:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662624 states to 662624 states and 702576 transitions. [2018-11-06 19:54:51,314 INFO L78 Accepts]: Start accepts. Automaton has 662624 states and 702576 transitions. Word has length 377 [2018-11-06 19:54:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:51,315 INFO L480 AbstractCegarLoop]: Abstraction has 662624 states and 702576 transitions. [2018-11-06 19:54:51,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 662624 states and 702576 transitions. [2018-11-06 19:54:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-11-06 19:54:51,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:51,400 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:54:51,401 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:51,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1633540290, now seen corresponding path program 2 times [2018-11-06 19:54:51,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:51,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-11-06 19:54:51,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:51,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:51,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:51,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:51,791 INFO L87 Difference]: Start difference. First operand 662624 states and 702576 transitions. Second operand 4 states. [2018-11-06 19:55:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:04,469 INFO L93 Difference]: Finished difference Result 1854870 states and 1963824 transitions. [2018-11-06 19:55:04,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:04,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2018-11-06 19:55:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:06,283 INFO L225 Difference]: With dead ends: 1854870 [2018-11-06 19:55:06,283 INFO L226 Difference]: Without dead ends: 1192248 [2018-11-06 19:55:06,598 INFO L604 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-11-06 19:55:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192248 states. [2018-11-06 19:55:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192248 to 1170534. [2018-11-06 19:55:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170534 states. [2018-11-06 19:55:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170534 states to 1170534 states and 1238157 transitions. [2018-11-06 19:55:39,144 INFO L78 Accepts]: Start accepts. Automaton has 1170534 states and 1238157 transitions. Word has length 412 [2018-11-06 19:55:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:39,145 INFO L480 AbstractCegarLoop]: Abstraction has 1170534 states and 1238157 transitions. [2018-11-06 19:55:39,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1170534 states and 1238157 transitions. [2018-11-06 19:55:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-11-06 19:55:39,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:39,198 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-06 19:55:39,198 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:39,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1247768010, now seen corresponding path program 1 times [2018-11-06 19:55:39,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:39,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:39,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:39,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 19:55:39,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-06 19:55:41,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:41,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:41,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:41,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:41,260 INFO L87 Difference]: Start difference. First operand 1170534 states and 1238157 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 19:55:49,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:49,858 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:55:49,865 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:55:49,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:55:49 BoogieIcfgContainer [2018-11-06 19:55:49,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:55:49,866 INFO L168 Benchmark]: Toolchain (without parser) took 201249.42 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.1 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 197.3 MB). Peak memory consumption was 5.3 GB. Max. memory is 7.1 GB. [2018-11-06 19:55:49,867 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:55:49,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1272.35 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:49,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -869.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:49,869 INFO L168 Benchmark]: Boogie Preprocessor took 136.53 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:55:49,870 INFO L168 Benchmark]: RCFGBuilder took 5274.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 257.4 MB). Peak memory consumption was 257.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:49,871 INFO L168 Benchmark]: TraceAbstraction took 194249.89 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 1.2 GB in the end (delta: 713.9 MB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. [2018-11-06 19:55:49,876 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.23 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 1272.35 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 310.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -869.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.53 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5274.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 257.4 MB). Peak memory consumption was 257.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194249.89 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 1.2 GB in the end (delta: 713.9 MB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1527]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1527). Cancelled while BasicCegarLoop was constructing difference of abstraction (1170534states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1572865 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.1s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 110.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4751 SDtfs, 17103 SDslu, 3203 SDs, 0 SdLazy, 26033 SolverSat, 5019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 640 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170534occurred in iteration=19, 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: 72.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 110258 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 5823 NumberOfCodeBlocks, 5823 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5801 ConstructedInterpolants, 0 QuantifiedInterpolants, 5517162 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 3170/3452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown