java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:56:47,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:56:47,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:56:47,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:56:47,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:56:47,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:56:47,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:56:47,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:56:47,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:56:47,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:56:47,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:56:47,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:56:47,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:56:47,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:56:47,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:56:47,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:56:47,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:56:47,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:56:47,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:56:47,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:56:47,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:56:47,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:56:47,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:56:47,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:56:47,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:56:47,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:56:47,842 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:56:47,843 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:56:47,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:56:47,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:56:47,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:56:47,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:56:47,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:56:47,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:56:47,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:56:47,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:56:47,855 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:56:47,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:56:47,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:56:47,885 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:56:47,885 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:56:47,886 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:56:47,886 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:56:47,886 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:56:47,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:56:47,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:56:47,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:56:47,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:56:47,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:56:47,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:56:47,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:56:47,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:56:47,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:56:47,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:56:47,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:56:47,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:56:47,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:56:47,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:56:47,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:56:47,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:56:47,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:56:47,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:56:47,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:56:47,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:56:47,891 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:56:47,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:56:47,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:56:47,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:56:47,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:56:47,977 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:56:47,978 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-10-23 18:56:48,045 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca45184a5/5119ee51b2fc4fd5893a12dffd901e70/FLAG6b0b90a4f [2018-10-23 18:56:48,718 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:56:48,719 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-10-23 18:56:48,743 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca45184a5/5119ee51b2fc4fd5893a12dffd901e70/FLAG6b0b90a4f [2018-10-23 18:56:48,759 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca45184a5/5119ee51b2fc4fd5893a12dffd901e70 [2018-10-23 18:56:48,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:56:48,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:56:48,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:56:48,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:56:48,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:56:48,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:56:48" (1/1) ... [2018-10-23 18:56:48,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f51eb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:48, skipping insertion in model container [2018-10-23 18:56:48,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:56:48" (1/1) ... [2018-10-23 18:56:48,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:56:48,881 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:56:49,548 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:56:49,554 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:56:49,913 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:56:49,940 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:56:49,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49 WrapperNode [2018-10-23 18:56:49,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:56:49,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:56:49,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:56:49,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:56:49,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:56:50,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:56:50,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:56:50,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:56:50,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... [2018-10-23 18:56:50,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:56:50,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:56:50,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:56:50,431 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:56:50,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:56:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:56:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:56:50,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:56:55,778 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:56:55,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:56:55 BoogieIcfgContainer [2018-10-23 18:56:55,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:56:55,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:56:55,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:56:55,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:56:55,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:56:48" (1/3) ... [2018-10-23 18:56:55,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aae6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:56:55, skipping insertion in model container [2018-10-23 18:56:55,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:49" (2/3) ... [2018-10-23 18:56:55,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aae6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:56:55, skipping insertion in model container [2018-10-23 18:56:55,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:56:55" (3/3) ... [2018-10-23 18:56:55,789 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label51_true-unreach-call.c [2018-10-23 18:56:55,801 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:56:55,811 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:56:55,830 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:56:55,876 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:56:55,877 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:56:55,877 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:56:55,877 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:56:55,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:56:55,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:56:55,878 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:56:55,878 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:56:55,878 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:56:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:56:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-23 18:56:55,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:55,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:56:55,930 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:55,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:55,935 INFO L82 PathProgramCache]: Analyzing trace with hash 328246770, now seen corresponding path program 1 times [2018-10-23 18:56:55,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:55,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:55,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:55,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:56,949 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:56:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:56:57,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:57,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:57,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:56:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:56:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:57,106 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:57:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:00,663 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-23 18:57:00,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:00,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-23 18:57:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:00,694 INFO L225 Difference]: With dead ends: 1089 [2018-10-23 18:57:00,694 INFO L226 Difference]: Without dead ends: 779 [2018-10-23 18:57:00,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-23 18:57:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-23 18:57:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-23 18:57:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-23 18:57:00,875 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 189 [2018-10-23 18:57:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:00,877 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-23 18:57:00,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-23 18:57:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-23 18:57:00,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:00,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:00,892 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:00,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1502852001, now seen corresponding path program 1 times [2018-10-23 18:57:00,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:01,173 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:57:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:01,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:01,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:01,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:01,226 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-23 18:57:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:09,002 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-23 18:57:09,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:09,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-10-23 18:57:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:09,012 INFO L225 Difference]: With dead ends: 1904 [2018-10-23 18:57:09,013 INFO L226 Difference]: Without dead ends: 1391 [2018-10-23 18:57:09,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-23 18:57:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-23 18:57:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-23 18:57:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-23 18:57:09,107 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 195 [2018-10-23 18:57:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:09,108 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-23 18:57:09,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-23 18:57:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-23 18:57:09,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:09,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:09,117 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:09,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1209056934, now seen corresponding path program 1 times [2018-10-23 18:57:09,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:09,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:09,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:09,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:09,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:09,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:09,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:09,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:09,272 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-23 18:57:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:11,322 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-23 18:57:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:11,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-10-23 18:57:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:11,341 INFO L225 Difference]: With dead ends: 2711 [2018-10-23 18:57:11,341 INFO L226 Difference]: Without dead ends: 1786 [2018-10-23 18:57:11,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-23 18:57:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-23 18:57:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-23 18:57:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-23 18:57:11,383 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 196 [2018-10-23 18:57:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:11,383 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-23 18:57:11,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-23 18:57:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-23 18:57:11,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:11,390 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:11,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash -10320045, now seen corresponding path program 1 times [2018-10-23 18:57:11,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:11,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:11,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:11,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:11,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:11,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:11,519 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-23 18:57:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:13,448 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-23 18:57:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:13,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-10-23 18:57:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:13,476 INFO L225 Difference]: With dead ends: 5215 [2018-10-23 18:57:13,476 INFO L226 Difference]: Without dead ends: 3433 [2018-10-23 18:57:13,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-23 18:57:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-23 18:57:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-23 18:57:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-23 18:57:13,640 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 198 [2018-10-23 18:57:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:13,640 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-23 18:57:13,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-23 18:57:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-23 18:57:13,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:13,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:13,650 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:13,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash 902017023, now seen corresponding path program 1 times [2018-10-23 18:57:13,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:13,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:57:14,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:14,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:57:14,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:14,178 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 4 states. [2018-10-23 18:57:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:18,278 INFO L93 Difference]: Finished difference Result 13157 states and 19901 transitions. [2018-10-23 18:57:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:18,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-23 18:57:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:18,334 INFO L225 Difference]: With dead ends: 13157 [2018-10-23 18:57:18,334 INFO L226 Difference]: Without dead ends: 9743 [2018-10-23 18:57:18,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9743 states. [2018-10-23 18:57:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9743 to 9741. [2018-10-23 18:57:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9741 states. [2018-10-23 18:57:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 13378 transitions. [2018-10-23 18:57:18,543 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 13378 transitions. Word has length 206 [2018-10-23 18:57:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:18,545 INFO L481 AbstractCegarLoop]: Abstraction has 9741 states and 13378 transitions. [2018-10-23 18:57:18,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 13378 transitions. [2018-10-23 18:57:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-23 18:57:18,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:18,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:18,570 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -900143218, now seen corresponding path program 1 times [2018-10-23 18:57:18,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:18,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:18,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:18,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:18,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:18,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:18,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:18,889 INFO L87 Difference]: Start difference. First operand 9741 states and 13378 transitions. Second operand 4 states. [2018-10-23 18:57:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:21,414 INFO L93 Difference]: Finished difference Result 37082 states and 50608 transitions. [2018-10-23 18:57:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:21,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-10-23 18:57:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:21,499 INFO L225 Difference]: With dead ends: 37082 [2018-10-23 18:57:21,500 INFO L226 Difference]: Without dead ends: 27343 [2018-10-23 18:57:21,522 INFO L605 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-10-23 18:57:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27343 states. [2018-10-23 18:57:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27343 to 18515. [2018-10-23 18:57:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18515 states. [2018-10-23 18:57:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18515 states to 18515 states and 24025 transitions. [2018-10-23 18:57:22,157 INFO L78 Accepts]: Start accepts. Automaton has 18515 states and 24025 transitions. Word has length 213 [2018-10-23 18:57:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:22,157 INFO L481 AbstractCegarLoop]: Abstraction has 18515 states and 24025 transitions. [2018-10-23 18:57:22,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 18515 states and 24025 transitions. [2018-10-23 18:57:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-23 18:57:22,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:22,198 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:22,198 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:22,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash -753012397, now seen corresponding path program 1 times [2018-10-23 18:57:22,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:22,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:22,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:22,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-23 18:57:22,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:22,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:22,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:22,395 INFO L87 Difference]: Start difference. First operand 18515 states and 24025 transitions. Second operand 3 states. [2018-10-23 18:57:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:23,676 INFO L93 Difference]: Finished difference Result 36180 states and 46915 transitions. [2018-10-23 18:57:23,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:23,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-10-23 18:57:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:23,714 INFO L225 Difference]: With dead ends: 36180 [2018-10-23 18:57:23,714 INFO L226 Difference]: Without dead ends: 17667 [2018-10-23 18:57:23,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17667 states. [2018-10-23 18:57:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17667 to 17667. [2018-10-23 18:57:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-10-23 18:57:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 22490 transitions. [2018-10-23 18:57:24,007 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 22490 transitions. Word has length 247 [2018-10-23 18:57:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:24,007 INFO L481 AbstractCegarLoop]: Abstraction has 17667 states and 22490 transitions. [2018-10-23 18:57:24,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 22490 transitions. [2018-10-23 18:57:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-23 18:57:24,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:24,040 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:24,040 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:24,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:24,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1019898388, now seen corresponding path program 1 times [2018-10-23 18:57:24,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:24,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:24,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-23 18:57:24,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:24,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:24,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:24,276 INFO L87 Difference]: Start difference. First operand 17667 states and 22490 transitions. Second operand 3 states. [2018-10-23 18:57:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:25,870 INFO L93 Difference]: Finished difference Result 40445 states and 51270 transitions. [2018-10-23 18:57:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:25,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-10-23 18:57:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:25,911 INFO L225 Difference]: With dead ends: 40445 [2018-10-23 18:57:25,912 INFO L226 Difference]: Without dead ends: 22780 [2018-10-23 18:57:25,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22780 states. [2018-10-23 18:57:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22780 to 22779. [2018-10-23 18:57:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22779 states. [2018-10-23 18:57:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22779 states to 22779 states and 28498 transitions. [2018-10-23 18:57:26,226 INFO L78 Accepts]: Start accepts. Automaton has 22779 states and 28498 transitions. Word has length 251 [2018-10-23 18:57:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:26,227 INFO L481 AbstractCegarLoop]: Abstraction has 22779 states and 28498 transitions. [2018-10-23 18:57:26,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 22779 states and 28498 transitions. [2018-10-23 18:57:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-23 18:57:26,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:26,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:26,266 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:26,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash -231929504, now seen corresponding path program 1 times [2018-10-23 18:57:26,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:26,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:26,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:26,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:26,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:26,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:26,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:26,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:26,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:26,853 INFO L87 Difference]: Start difference. First operand 22779 states and 28498 transitions. Second operand 4 states. [2018-10-23 18:57:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:28,821 INFO L93 Difference]: Finished difference Result 54995 states and 68164 transitions. [2018-10-23 18:57:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:28,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-10-23 18:57:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:28,864 INFO L225 Difference]: With dead ends: 54995 [2018-10-23 18:57:28,864 INFO L226 Difference]: Without dead ends: 32218 [2018-10-23 18:57:28,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32218 states. [2018-10-23 18:57:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32218 to 23607. [2018-10-23 18:57:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23607 states. [2018-10-23 18:57:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23607 states to 23607 states and 29214 transitions. [2018-10-23 18:57:29,250 INFO L78 Accepts]: Start accepts. Automaton has 23607 states and 29214 transitions. Word has length 253 [2018-10-23 18:57:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:29,251 INFO L481 AbstractCegarLoop]: Abstraction has 23607 states and 29214 transitions. [2018-10-23 18:57:29,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 23607 states and 29214 transitions. [2018-10-23 18:57:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-23 18:57:29,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:29,279 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:29,280 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:29,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1756670744, now seen corresponding path program 1 times [2018-10-23 18:57:29,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:29,718 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-23 18:57:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-23 18:57:29,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:57:29,908 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:57:29,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:30,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:57:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:57:30,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:57:30,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:57:30,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:57:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:57:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:57:30,194 INFO L87 Difference]: Start difference. First operand 23607 states and 29214 transitions. Second operand 7 states. [2018-10-23 18:57:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:35,934 INFO L93 Difference]: Finished difference Result 54747 states and 67440 transitions. [2018-10-23 18:57:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 18:57:35,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2018-10-23 18:57:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:35,985 INFO L225 Difference]: With dead ends: 54747 [2018-10-23 18:57:35,985 INFO L226 Difference]: Without dead ends: 31142 [2018-10-23 18:57:36,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-23 18:57:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31142 states. [2018-10-23 18:57:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31142 to 30524. [2018-10-23 18:57:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30524 states. [2018-10-23 18:57:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30524 states to 30524 states and 34505 transitions. [2018-10-23 18:57:36,438 INFO L78 Accepts]: Start accepts. Automaton has 30524 states and 34505 transitions. Word has length 259 [2018-10-23 18:57:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:36,440 INFO L481 AbstractCegarLoop]: Abstraction has 30524 states and 34505 transitions. [2018-10-23 18:57:36,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:57:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30524 states and 34505 transitions. [2018-10-23 18:57:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-23 18:57:36,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:36,461 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:57:36,461 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:36,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1340174540, now seen corresponding path program 1 times [2018-10-23 18:57:36,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:36,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:36,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:36,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:36,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:57:36,875 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:57:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:36,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:57:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:57:37,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:57:37,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:57:37,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:57:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:57:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:57:37,095 INFO L87 Difference]: Start difference. First operand 30524 states and 34505 transitions. Second operand 6 states. [2018-10-23 18:57:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:41,431 INFO L93 Difference]: Finished difference Result 85634 states and 96626 transitions. [2018-10-23 18:57:41,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:57:41,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 261 [2018-10-23 18:57:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:41,518 INFO L225 Difference]: With dead ends: 85634 [2018-10-23 18:57:41,518 INFO L226 Difference]: Without dead ends: 55112 [2018-10-23 18:57:41,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-23 18:57:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55112 states. [2018-10-23 18:57:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55112 to 49788. [2018-10-23 18:57:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49788 states. [2018-10-23 18:57:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49788 states to 49788 states and 55263 transitions. [2018-10-23 18:57:42,293 INFO L78 Accepts]: Start accepts. Automaton has 49788 states and 55263 transitions. Word has length 261 [2018-10-23 18:57:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:42,294 INFO L481 AbstractCegarLoop]: Abstraction has 49788 states and 55263 transitions. [2018-10-23 18:57:42,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:57:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49788 states and 55263 transitions. [2018-10-23 18:57:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-23 18:57:42,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:42,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:42,308 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:42,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash -404953050, now seen corresponding path program 1 times [2018-10-23 18:57:42,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:42,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:42,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:42,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:42,707 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:57:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:42,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:57:42,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:42,792 INFO L87 Difference]: Start difference. First operand 49788 states and 55263 transitions. Second operand 4 states. [2018-10-23 18:57:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:44,697 INFO L93 Difference]: Finished difference Result 99382 states and 110328 transitions. [2018-10-23 18:57:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:44,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-10-23 18:57:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:44,756 INFO L225 Difference]: With dead ends: 99382 [2018-10-23 18:57:44,756 INFO L226 Difference]: Without dead ends: 49596 [2018-10-23 18:57:44,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49596 states. [2018-10-23 18:57:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49596 to 49583. [2018-10-23 18:57:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49583 states. [2018-10-23 18:57:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49583 states to 49583 states and 54701 transitions. [2018-10-23 18:57:45,423 INFO L78 Accepts]: Start accepts. Automaton has 49583 states and 54701 transitions. Word has length 264 [2018-10-23 18:57:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:45,423 INFO L481 AbstractCegarLoop]: Abstraction has 49583 states and 54701 transitions. [2018-10-23 18:57:45,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 49583 states and 54701 transitions. [2018-10-23 18:57:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-23 18:57:45,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:45,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:45,449 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:45,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash -692707392, now seen corresponding path program 1 times [2018-10-23 18:57:45,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:45,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:46,528 WARN L179 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-23 18:57:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:46,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:46,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:46,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:46,665 INFO L87 Difference]: Start difference. First operand 49583 states and 54701 transitions. Second operand 4 states. [2018-10-23 18:57:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:48,822 INFO L93 Difference]: Finished difference Result 109003 states and 119959 transitions. [2018-10-23 18:57:48,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:48,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-10-23 18:57:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:48,882 INFO L225 Difference]: With dead ends: 109003 [2018-10-23 18:57:48,883 INFO L226 Difference]: Without dead ends: 59422 [2018-10-23 18:57:48,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59422 states. [2018-10-23 18:57:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59422 to 51206. [2018-10-23 18:57:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51206 states. [2018-10-23 18:57:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51206 states to 51206 states and 55941 transitions. [2018-10-23 18:57:49,452 INFO L78 Accepts]: Start accepts. Automaton has 51206 states and 55941 transitions. Word has length 320 [2018-10-23 18:57:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:49,452 INFO L481 AbstractCegarLoop]: Abstraction has 51206 states and 55941 transitions. [2018-10-23 18:57:49,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51206 states and 55941 transitions. [2018-10-23 18:57:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-23 18:57:49,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:49,468 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:49,469 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:49,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1045920108, now seen corresponding path program 1 times [2018-10-23 18:57:49,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:49,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:50,259 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 18:57:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:50,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:57:50,427 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:57:50,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:50,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:57:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:50,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:57:50,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:57:50,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 18:57:50,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 18:57:50,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-23 18:57:50,978 INFO L87 Difference]: Start difference. First operand 51206 states and 55941 transitions. Second operand 8 states. [2018-10-23 18:58:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:01,646 INFO L93 Difference]: Finished difference Result 124565 states and 135978 transitions. [2018-10-23 18:58:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 18:58:01,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2018-10-23 18:58:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:01,736 INFO L225 Difference]: With dead ends: 124565 [2018-10-23 18:58:01,736 INFO L226 Difference]: Without dead ends: 73361 [2018-10-23 18:58:01,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-10-23 18:58:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73361 states. [2018-10-23 18:58:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73361 to 69230. [2018-10-23 18:58:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69230 states. [2018-10-23 18:58:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69230 states to 69230 states and 75341 transitions. [2018-10-23 18:58:02,834 INFO L78 Accepts]: Start accepts. Automaton has 69230 states and 75341 transitions. Word has length 328 [2018-10-23 18:58:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:02,834 INFO L481 AbstractCegarLoop]: Abstraction has 69230 states and 75341 transitions. [2018-10-23 18:58:02,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 18:58:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 69230 states and 75341 transitions. [2018-10-23 18:58:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-23 18:58:02,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:02,865 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:58:02,866 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:02,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash 814019458, now seen corresponding path program 1 times [2018-10-23 18:58:02,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:02,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:02,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:02,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-23 18:58:03,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:03,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:03,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:03,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:03,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:03,291 INFO L87 Difference]: Start difference. First operand 69230 states and 75341 transitions. Second operand 4 states. [2018-10-23 18:58:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:07,877 INFO L93 Difference]: Finished difference Result 249671 states and 271194 transitions. [2018-10-23 18:58:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:07,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-10-23 18:58:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:08,066 INFO L225 Difference]: With dead ends: 249671 [2018-10-23 18:58:08,066 INFO L226 Difference]: Without dead ends: 180443 [2018-10-23 18:58:08,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180443 states. [2018-10-23 18:58:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180443 to 180439. [2018-10-23 18:58:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180439 states. [2018-10-23 18:58:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180439 states to 180439 states and 195708 transitions. [2018-10-23 18:58:10,147 INFO L78 Accepts]: Start accepts. Automaton has 180439 states and 195708 transitions. Word has length 350 [2018-10-23 18:58:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:10,147 INFO L481 AbstractCegarLoop]: Abstraction has 180439 states and 195708 transitions. [2018-10-23 18:58:10,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 180439 states and 195708 transitions. [2018-10-23 18:58:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-23 18:58:10,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:10,169 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, 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, 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] [2018-10-23 18:58:10,169 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:10,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1125365127, now seen corresponding path program 1 times [2018-10-23 18:58:10,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:10,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:10,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:10,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:10,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:10,597 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 18:58:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-23 18:58:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:58:10,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:10,671 INFO L87 Difference]: Start difference. First operand 180439 states and 195708 transitions. Second operand 4 states. [2018-10-23 18:58:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:13,551 INFO L93 Difference]: Finished difference Result 367672 states and 398734 transitions. [2018-10-23 18:58:13,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:13,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-10-23 18:58:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:13,767 INFO L225 Difference]: With dead ends: 367672 [2018-10-23 18:58:13,767 INFO L226 Difference]: Without dead ends: 187235 [2018-10-23 18:58:13,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187235 states. [2018-10-23 18:58:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187235 to 180847. [2018-10-23 18:58:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180847 states. [2018-10-23 18:58:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180847 states to 180847 states and 195694 transitions. [2018-10-23 18:58:15,872 INFO L78 Accepts]: Start accepts. Automaton has 180847 states and 195694 transitions. Word has length 375 [2018-10-23 18:58:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:15,873 INFO L481 AbstractCegarLoop]: Abstraction has 180847 states and 195694 transitions. [2018-10-23 18:58:15,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 180847 states and 195694 transitions. [2018-10-23 18:58:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-23 18:58:15,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:15,891 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:15,891 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:15,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash 638135135, now seen corresponding path program 1 times [2018-10-23 18:58:15,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:15,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:15,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-23 18:58:17,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:17,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:17,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:17,206 INFO L87 Difference]: Start difference. First operand 180847 states and 195694 transitions. Second operand 4 states. [2018-10-23 18:58:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:20,460 INFO L93 Difference]: Finished difference Result 522978 states and 564274 transitions. [2018-10-23 18:58:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:20,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-10-23 18:58:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:20,851 INFO L225 Difference]: With dead ends: 522978 [2018-10-23 18:58:20,851 INFO L226 Difference]: Without dead ends: 342133 [2018-10-23 18:58:20,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342133 states. [2018-10-23 18:58:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342133 to 337419. [2018-10-23 18:58:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337419 states. [2018-10-23 18:58:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337419 states to 337419 states and 363526 transitions. [2018-10-23 18:58:26,132 INFO L78 Accepts]: Start accepts. Automaton has 337419 states and 363526 transitions. Word has length 381 [2018-10-23 18:58:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:26,132 INFO L481 AbstractCegarLoop]: Abstraction has 337419 states and 363526 transitions. [2018-10-23 18:58:26,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 337419 states and 363526 transitions. [2018-10-23 18:58:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-23 18:58:26,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:26,178 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:58:26,178 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:26,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:26,178 INFO L82 PathProgramCache]: Analyzing trace with hash 176181070, now seen corresponding path program 1 times [2018-10-23 18:58:26,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:26,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:26,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:58:26,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:26,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:26,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:26,504 INFO L87 Difference]: Start difference. First operand 337419 states and 363526 transitions. Second operand 3 states. [2018-10-23 18:58:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:31,309 INFO L93 Difference]: Finished difference Result 650675 states and 700804 transitions. [2018-10-23 18:58:31,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:31,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-10-23 18:58:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:31,655 INFO L225 Difference]: With dead ends: 650675 [2018-10-23 18:58:31,655 INFO L226 Difference]: Without dead ends: 313462 [2018-10-23 18:58:31,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313462 states. [2018-10-23 18:58:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313462 to 302208. [2018-10-23 18:58:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302208 states. [2018-10-23 18:58:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302208 states to 302208 states and 320903 transitions. [2018-10-23 18:58:43,365 INFO L78 Accepts]: Start accepts. Automaton has 302208 states and 320903 transitions. Word has length 381 [2018-10-23 18:58:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:43,366 INFO L481 AbstractCegarLoop]: Abstraction has 302208 states and 320903 transitions. [2018-10-23 18:58:43,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:58:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 302208 states and 320903 transitions. [2018-10-23 18:58:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-23 18:58:43,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:43,383 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:43,383 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:43,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 984790807, now seen corresponding path program 1 times [2018-10-23 18:58:43,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:44,081 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-23 18:58:44,379 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-10-23 18:58:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 269 proven. 10 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-23 18:58:44,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:58:44,526 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:58:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:45,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:58:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-23 18:58:45,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:58:45,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-23 18:58:45,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 18:58:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 18:58:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-23 18:58:45,535 INFO L87 Difference]: Start difference. First operand 302208 states and 320903 transitions. Second operand 8 states. [2018-10-23 18:59:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:05,072 INFO L93 Difference]: Finished difference Result 2173623 states and 2304691 transitions. [2018-10-23 18:59:05,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-23 18:59:05,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 409 [2018-10-23 18:59:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:07,977 INFO L225 Difference]: With dead ends: 2173623 [2018-10-23 18:59:07,977 INFO L226 Difference]: Without dead ends: 1849502 [2018-10-23 18:59:08,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-23 18:59:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849502 states. [2018-10-23 18:59:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849502 to 1126526. [2018-10-23 18:59:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126526 states. [2018-10-23 18:59:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126526 states to 1126526 states and 1186868 transitions. [2018-10-23 18:59:45,312 INFO L78 Accepts]: Start accepts. Automaton has 1126526 states and 1186868 transitions. Word has length 409 [2018-10-23 18:59:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:45,312 INFO L481 AbstractCegarLoop]: Abstraction has 1126526 states and 1186868 transitions. [2018-10-23 18:59:45,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 18:59:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1126526 states and 1186868 transitions. [2018-10-23 18:59:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-23 18:59:45,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:45,346 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-23 18:59:45,346 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:45,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1535272811, now seen corresponding path program 1 times [2018-10-23 18:59:45,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:45,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:45,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:45,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:45,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-23 18:59:45,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:59:45,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:59:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:59:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:45,940 INFO L87 Difference]: Start difference. First operand 1126526 states and 1186868 transitions. Second operand 4 states. Received shutdown request... [2018-10-23 19:00:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 19:00:08,696 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 19:00:08,702 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 19:00:08,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 07:00:08 BoogieIcfgContainer [2018-10-23 19:00:08,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 19:00:08,704 INFO L168 Benchmark]: Toolchain (without parser) took 199932.12 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 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. [2018-10-23 19:00:08,706 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 19:00:08,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1166.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:08,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 352.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -867.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:08,709 INFO L168 Benchmark]: Boogie Preprocessor took 134.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:08,709 INFO L168 Benchmark]: RCFGBuilder took 5349.31 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: 249.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:08,711 INFO L168 Benchmark]: TraceAbstraction took 192921.96 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 3.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-23 19:00:08,721 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.22 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 1166.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 352.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -867.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5349.31 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: 249.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192921.96 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 3.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1599]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1599). Cancelled while BasicCegarLoop was constructing difference of abstraction (1126526states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (2148105 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.8s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 115.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5739 SDtfs, 20254 SDslu, 5118 SDs, 0 SdLazy, 29815 SolverSat, 5142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1374 GetRequests, 1292 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1126526occurred 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: 63.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 781827 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 6945 NumberOfCodeBlocks, 6945 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6921 ConstructedInterpolants, 0 QuantifiedInterpolants, 5185682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2201 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 3657/3679 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown