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_label08_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:50,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:50,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:50,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:50,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:50,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:50,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:50,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:50,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:50,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:50,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:50,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:50,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:50,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:50,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:50,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:50,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:50,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:50,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:50,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:50,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:50,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:50,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:50,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:50,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:50,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:50,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:50,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:50,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:50,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:50,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:50,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:50,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:50,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:50,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:50,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:50,955 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-24 14:53:50,971 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:50,971 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:50,973 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:50,974 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:50,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:50,975 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:50,975 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:50,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:50,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:50,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:50,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:50,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:50,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:50,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:50,976 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:50,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:50,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:50,977 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:50,977 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:50,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:50,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:50,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:50,981 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:50,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:50,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:50,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:50,981 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:50,982 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:51,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:51,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:51,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:51,073 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:51,074 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:51,074 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-10-24 14:53:51,141 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/463d15fb7/465b1842eabf4c82a79591fd14581b47/FLAG8608a852d [2018-10-24 14:53:51,863 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:51,864 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-10-24 14:53:51,885 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/463d15fb7/465b1842eabf4c82a79591fd14581b47/FLAG8608a852d [2018-10-24 14:53:51,901 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/463d15fb7/465b1842eabf4c82a79591fd14581b47 [2018-10-24 14:53:51,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:51,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:51,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:51,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:51,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:51,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:51,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75024a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:51, skipping insertion in model container [2018-10-24 14:53:51,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:51" (1/1) ... [2018-10-24 14:53:51,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:52,024 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:52,800 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:52,806 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:53,087 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:53,121 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:53,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53 WrapperNode [2018-10-24 14:53:53,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:53,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:53,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:53,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:53,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:53,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:53,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:53,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:53,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (1/1) ... [2018-10-24 14:53:53,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:53,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:53,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:53,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:53,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (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-24 14:53:53,659 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:53,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:53,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:59,006 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:59,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:59 BoogieIcfgContainer [2018-10-24 14:53:59,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:59,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:59,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:59,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:59,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:51" (1/3) ... [2018-10-24 14:53:59,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a846006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:59, skipping insertion in model container [2018-10-24 14:53:59,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:53" (2/3) ... [2018-10-24 14:53:59,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a846006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:59, skipping insertion in model container [2018-10-24 14:53:59,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:59" (3/3) ... [2018-10-24 14:53:59,015 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label08_true-unreach-call.c [2018-10-24 14:53:59,026 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:59,034 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:59,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:59,086 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:59,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:59,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:59,088 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:59,088 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:59,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:59,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:59,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:59,089 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-24 14:53:59,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:59,147 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] [2018-10-24 14:53:59,150 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:59,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1617915860, now seen corresponding path program 1 times [2018-10-24 14:53:59,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:59,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:59,979 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:54:00,047 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-24 14:54:00,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:00,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:00,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:00,079 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:54:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:03,707 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 14:54:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:03,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-10-24 14:54:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:03,734 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 14:54:03,734 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 14:54:03,740 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-24 14:54:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 14:54:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 14:54:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 14:54:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 14:54:03,834 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 158 [2018-10-24 14:54:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:03,835 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 14:54:03,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 14:54:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 14:54:03,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:03,842 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] [2018-10-24 14:54:03,842 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:03,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1348626709, now seen corresponding path program 1 times [2018-10-24 14:54:03,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:03,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:03,977 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-24 14:54:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:03,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:03,980 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 14:54:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:05,890 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 14:54:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:05,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-10-24 14:54:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:05,899 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 14:54:05,899 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 14:54:05,904 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-24 14:54:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 14:54:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 14:54:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 14:54:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 14:54:05,954 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 167 [2018-10-24 14:54:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:05,954 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 14:54:05,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 14:54:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 14:54:05,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:05,968 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] [2018-10-24 14:54:05,968 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:05,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1364601921, now seen corresponding path program 1 times [2018-10-24 14:54:05,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:05,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:05,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:05,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:05,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:06,277 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-24 14:54:06,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:06,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:06,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:06,279 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 14:54:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:09,958 INFO L93 Difference]: Finished difference Result 3901 states and 6135 transitions. [2018-10-24 14:54:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:09,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-24 14:54:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:09,972 INFO L225 Difference]: With dead ends: 3901 [2018-10-24 14:54:09,972 INFO L226 Difference]: Without dead ends: 2572 [2018-10-24 14:54:09,975 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-24 14:54:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2018-10-24 14:54:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2558. [2018-10-24 14:54:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-24 14:54:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3854 transitions. [2018-10-24 14:54:10,032 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3854 transitions. Word has length 175 [2018-10-24 14:54:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:10,032 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 3854 transitions. [2018-10-24 14:54:10,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3854 transitions. [2018-10-24 14:54:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 14:54:10,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:10,038 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:10,039 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:10,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 408853660, now seen corresponding path program 1 times [2018-10-24 14:54:10,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:10,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:10,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:54:10,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:10,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:10,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:10,173 INFO L87 Difference]: Start difference. First operand 2558 states and 3854 transitions. Second operand 3 states. [2018-10-24 14:54:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:12,627 INFO L93 Difference]: Finished difference Result 5091 states and 7675 transitions. [2018-10-24 14:54:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:12,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-24 14:54:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:12,642 INFO L225 Difference]: With dead ends: 5091 [2018-10-24 14:54:12,642 INFO L226 Difference]: Without dead ends: 2535 [2018-10-24 14:54:12,646 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-24 14:54:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-24 14:54:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2535. [2018-10-24 14:54:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2018-10-24 14:54:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3747 transitions. [2018-10-24 14:54:12,704 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3747 transitions. Word has length 189 [2018-10-24 14:54:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:12,705 INFO L481 AbstractCegarLoop]: Abstraction has 2535 states and 3747 transitions. [2018-10-24 14:54:12,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3747 transitions. [2018-10-24 14:54:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 14:54:12,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:12,713 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:54:12,713 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:12,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1261203664, now seen corresponding path program 1 times [2018-10-24 14:54:12,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:12,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:12,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:12,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:12,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:12,907 INFO L87 Difference]: Start difference. First operand 2535 states and 3747 transitions. Second operand 3 states. [2018-10-24 14:54:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:14,657 INFO L93 Difference]: Finished difference Result 7314 states and 10763 transitions. [2018-10-24 14:54:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:14,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-24 14:54:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:14,678 INFO L225 Difference]: With dead ends: 7314 [2018-10-24 14:54:14,679 INFO L226 Difference]: Without dead ends: 4781 [2018-10-24 14:54:14,683 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-24 14:54:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-10-24 14:54:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2018-10-24 14:54:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-10-24 14:54:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6617 transitions. [2018-10-24 14:54:14,766 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6617 transitions. Word has length 210 [2018-10-24 14:54:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:14,767 INFO L481 AbstractCegarLoop]: Abstraction has 4778 states and 6617 transitions. [2018-10-24 14:54:14,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6617 transitions. [2018-10-24 14:54:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-24 14:54:14,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:14,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:54:14,776 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:14,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1940533706, now seen corresponding path program 1 times [2018-10-24 14:54:14,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:14,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:14,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:15,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:15,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:15,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:15,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:15,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:15,069 INFO L87 Difference]: Start difference. First operand 4778 states and 6617 transitions. Second operand 4 states. [2018-10-24 14:54:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:17,654 INFO L93 Difference]: Finished difference Result 17751 states and 24441 transitions. [2018-10-24 14:54:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:17,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-10-24 14:54:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:17,701 INFO L225 Difference]: With dead ends: 17751 [2018-10-24 14:54:17,701 INFO L226 Difference]: Without dead ends: 12975 [2018-10-24 14:54:17,710 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-24 14:54:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-10-24 14:54:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 9063. [2018-10-24 14:54:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-10-24 14:54:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11954 transitions. [2018-10-24 14:54:17,887 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11954 transitions. Word has length 213 [2018-10-24 14:54:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:17,888 INFO L481 AbstractCegarLoop]: Abstraction has 9063 states and 11954 transitions. [2018-10-24 14:54:17,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11954 transitions. [2018-10-24 14:54:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 14:54:17,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:17,904 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-10-24 14:54:17,904 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:17,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash -12059043, now seen corresponding path program 1 times [2018-10-24 14:54:17,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:17,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:54:18,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:18,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:18,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:18,053 INFO L87 Difference]: Start difference. First operand 9063 states and 11954 transitions. Second operand 3 states. [2018-10-24 14:54:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:19,650 INFO L93 Difference]: Finished difference Result 23069 states and 30331 transitions. [2018-10-24 14:54:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:19,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-24 14:54:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:19,711 INFO L225 Difference]: With dead ends: 23069 [2018-10-24 14:54:19,711 INFO L226 Difference]: Without dead ends: 14008 [2018-10-24 14:54:19,723 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-24 14:54:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14008 states. [2018-10-24 14:54:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14008 to 14005. [2018-10-24 14:54:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14005 states. [2018-10-24 14:54:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14005 states to 14005 states and 18328 transitions. [2018-10-24 14:54:20,041 INFO L78 Accepts]: Start accepts. Automaton has 14005 states and 18328 transitions. Word has length 222 [2018-10-24 14:54:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:20,041 INFO L481 AbstractCegarLoop]: Abstraction has 14005 states and 18328 transitions. [2018-10-24 14:54:20,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14005 states and 18328 transitions. [2018-10-24 14:54:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-24 14:54:20,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:20,066 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, 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] [2018-10-24 14:54:20,066 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:20,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1088101623, now seen corresponding path program 1 times [2018-10-24 14:54:20,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:20,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:54:20,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:20,398 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-24 14:54:20,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:20,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 14:54:20,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:20,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:54:20,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:54:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:54:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:54:20,743 INFO L87 Difference]: Start difference. First operand 14005 states and 18328 transitions. Second operand 6 states. [2018-10-24 14:54:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:27,866 INFO L93 Difference]: Finished difference Result 85662 states and 112685 transitions. [2018-10-24 14:54:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:54:27,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-10-24 14:54:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:28,011 INFO L225 Difference]: With dead ends: 85662 [2018-10-24 14:54:28,011 INFO L226 Difference]: Without dead ends: 71659 [2018-10-24 14:54:28,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:54:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71659 states. [2018-10-24 14:54:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71659 to 70421. [2018-10-24 14:54:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70421 states. [2018-10-24 14:54:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70421 states to 70421 states and 86088 transitions. [2018-10-24 14:54:29,145 INFO L78 Accepts]: Start accepts. Automaton has 70421 states and 86088 transitions. Word has length 230 [2018-10-24 14:54:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:29,145 INFO L481 AbstractCegarLoop]: Abstraction has 70421 states and 86088 transitions. [2018-10-24 14:54:29,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:54:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 70421 states and 86088 transitions. [2018-10-24 14:54:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 14:54:29,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:29,209 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:54:29,210 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:29,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash -307747242, now seen corresponding path program 1 times [2018-10-24 14:54:29,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:29,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:29,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:29,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:29,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:29,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:29,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:29,429 INFO L87 Difference]: Start difference. First operand 70421 states and 86088 transitions. Second operand 3 states. [2018-10-24 14:54:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:31,294 INFO L93 Difference]: Finished difference Result 136010 states and 165688 transitions. [2018-10-24 14:54:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:31,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-24 14:54:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:31,423 INFO L225 Difference]: With dead ends: 136010 [2018-10-24 14:54:31,423 INFO L226 Difference]: Without dead ends: 65591 [2018-10-24 14:54:31,487 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-24 14:54:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65591 states. [2018-10-24 14:54:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65591 to 65584. [2018-10-24 14:54:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65584 states. [2018-10-24 14:54:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65584 states to 65584 states and 76213 transitions. [2018-10-24 14:54:32,948 INFO L78 Accepts]: Start accepts. Automaton has 65584 states and 76213 transitions. Word has length 237 [2018-10-24 14:54:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:32,949 INFO L481 AbstractCegarLoop]: Abstraction has 65584 states and 76213 transitions. [2018-10-24 14:54:32,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65584 states and 76213 transitions. [2018-10-24 14:54:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-24 14:54:33,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:33,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:54:33,002 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:33,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:33,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1654308121, now seen corresponding path program 1 times [2018-10-24 14:54:33,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:33,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:33,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:33,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:33,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:33,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:33,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:33,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:33,310 INFO L87 Difference]: Start difference. First operand 65584 states and 76213 transitions. Second operand 3 states. [2018-10-24 14:54:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:35,044 INFO L93 Difference]: Finished difference Result 171765 states and 199387 transitions. [2018-10-24 14:54:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:35,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-10-24 14:54:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:35,173 INFO L225 Difference]: With dead ends: 171765 [2018-10-24 14:54:35,174 INFO L226 Difference]: Without dead ends: 106183 [2018-10-24 14:54:35,224 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-24 14:54:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106183 states. [2018-10-24 14:54:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106183 to 106178. [2018-10-24 14:54:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106178 states. [2018-10-24 14:54:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106178 states to 106178 states and 123027 transitions. [2018-10-24 14:54:36,970 INFO L78 Accepts]: Start accepts. Automaton has 106178 states and 123027 transitions. Word has length 274 [2018-10-24 14:54:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:36,970 INFO L481 AbstractCegarLoop]: Abstraction has 106178 states and 123027 transitions. [2018-10-24 14:54:36,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 106178 states and 123027 transitions. [2018-10-24 14:54:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-24 14:54:37,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:37,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:54:37,032 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:37,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1442636741, now seen corresponding path program 1 times [2018-10-24 14:54:37,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:37,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:37,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:37,478 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:54:38,400 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-24 14:54:38,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:38,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-24 14:54:38,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:54:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:54:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:54:38,402 INFO L87 Difference]: Start difference. First operand 106178 states and 123027 transitions. Second operand 11 states. [2018-10-24 14:54:38,898 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-24 14:54:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:46,050 INFO L93 Difference]: Finished difference Result 319247 states and 366301 transitions. [2018-10-24 14:54:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:54:46,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-10-24 14:54:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:46,371 INFO L225 Difference]: With dead ends: 319247 [2018-10-24 14:54:46,372 INFO L226 Difference]: Without dead ends: 213071 [2018-10-24 14:54:46,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-10-24 14:54:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213071 states. [2018-10-24 14:54:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213071 to 210692. [2018-10-24 14:54:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210692 states. [2018-10-24 14:54:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210692 states to 210692 states and 240627 transitions. [2018-10-24 14:54:50,081 INFO L78 Accepts]: Start accepts. Automaton has 210692 states and 240627 transitions. Word has length 282 [2018-10-24 14:54:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:50,081 INFO L481 AbstractCegarLoop]: Abstraction has 210692 states and 240627 transitions. [2018-10-24 14:54:50,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 14:54:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 210692 states and 240627 transitions. [2018-10-24 14:54:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-24 14:54:50,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:50,188 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:54:50,189 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:50,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash -985106448, now seen corresponding path program 1 times [2018-10-24 14:54:50,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-10-24 14:54:50,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:50,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:50,358 INFO L87 Difference]: Start difference. First operand 210692 states and 240627 transitions. Second operand 3 states. [2018-10-24 14:54:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:53,009 INFO L93 Difference]: Finished difference Result 418111 states and 477909 transitions. [2018-10-24 14:54:53,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:53,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-10-24 14:54:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:53,223 INFO L225 Difference]: With dead ends: 418111 [2018-10-24 14:54:53,223 INFO L226 Difference]: Without dead ends: 207421 [2018-10-24 14:54:53,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207421 states. [2018-10-24 14:54:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207421 to 207389. [2018-10-24 14:54:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207389 states. [2018-10-24 14:54:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207389 states to 207389 states and 229056 transitions. [2018-10-24 14:54:57,225 INFO L78 Accepts]: Start accepts. Automaton has 207389 states and 229056 transitions. Word has length 313 [2018-10-24 14:54:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:57,225 INFO L481 AbstractCegarLoop]: Abstraction has 207389 states and 229056 transitions. [2018-10-24 14:54:57,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 207389 states and 229056 transitions. [2018-10-24 14:54:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-24 14:54:57,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:57,288 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:57,288 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:57,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:57,289 INFO L82 PathProgramCache]: Analyzing trace with hash 298861796, now seen corresponding path program 1 times [2018-10-24 14:54:57,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:57,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:57,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:57,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:57,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-24 14:54:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:57,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:57,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:57,615 INFO L87 Difference]: Start difference. First operand 207389 states and 229056 transitions. Second operand 4 states. [2018-10-24 14:55:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:03,277 INFO L93 Difference]: Finished difference Result 608923 states and 670921 transitions. [2018-10-24 14:55:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:03,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-10-24 14:55:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:03,811 INFO L225 Difference]: With dead ends: 608923 [2018-10-24 14:55:03,811 INFO L226 Difference]: Without dead ends: 401536 [2018-10-24 14:55:03,980 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-24 14:55:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401536 states. [2018-10-24 14:55:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401536 to 396796. [2018-10-24 14:55:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396796 states. [2018-10-24 14:55:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396796 states to 396796 states and 436615 transitions. [2018-10-24 14:55:15,825 INFO L78 Accepts]: Start accepts. Automaton has 396796 states and 436615 transitions. Word has length 317 [2018-10-24 14:55:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:15,825 INFO L481 AbstractCegarLoop]: Abstraction has 396796 states and 436615 transitions. [2018-10-24 14:55:15,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 396796 states and 436615 transitions. [2018-10-24 14:55:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-24 14:55:15,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:15,948 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:55:15,948 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:15,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:15,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1895868189, now seen corresponding path program 1 times [2018-10-24 14:55:15,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:15,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:15,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:16,320 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:55:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-24 14:55:16,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:16,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:16,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:16,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:16,435 INFO L87 Difference]: Start difference. First operand 396796 states and 436615 transitions. Second operand 4 states. [2018-10-24 14:55:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:21,733 INFO L93 Difference]: Finished difference Result 785515 states and 864790 transitions. [2018-10-24 14:55:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:21,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2018-10-24 14:55:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:22,251 INFO L225 Difference]: With dead ends: 785515 [2018-10-24 14:55:22,252 INFO L226 Difference]: Without dead ends: 388721 [2018-10-24 14:55:22,464 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-24 14:55:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388721 states. [2018-10-24 14:55:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388721 to 387781. [2018-10-24 14:55:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387781 states. [2018-10-24 14:55:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387781 states to 387781 states and 424956 transitions. [2018-10-24 14:55:28,694 INFO L78 Accepts]: Start accepts. Automaton has 387781 states and 424956 transitions. Word has length 372 [2018-10-24 14:55:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:28,694 INFO L481 AbstractCegarLoop]: Abstraction has 387781 states and 424956 transitions. [2018-10-24 14:55:28,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 387781 states and 424956 transitions. [2018-10-24 14:55:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-24 14:55:30,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:30,190 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:55:30,191 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:30,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 663501376, now seen corresponding path program 1 times [2018-10-24 14:55:30,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:30,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:30,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:30,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:30,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-24 14:55:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:30,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:30,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:30,660 INFO L87 Difference]: Start difference. First operand 387781 states and 424956 transitions. Second operand 4 states. [2018-10-24 14:55:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:40,986 INFO L93 Difference]: Finished difference Result 775630 states and 850037 transitions. [2018-10-24 14:55:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:40,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2018-10-24 14:55:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:41,413 INFO L225 Difference]: With dead ends: 775630 [2018-10-24 14:55:41,414 INFO L226 Difference]: Without dead ends: 387851 [2018-10-24 14:55:41,550 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-24 14:55:41,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387851 states. [2018-10-24 14:55:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387851 to 387781. [2018-10-24 14:55:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387781 states. [2018-10-24 14:55:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387781 states to 387781 states and 420600 transitions. [2018-10-24 14:55:46,679 INFO L78 Accepts]: Start accepts. Automaton has 387781 states and 420600 transitions. Word has length 386 [2018-10-24 14:55:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:46,680 INFO L481 AbstractCegarLoop]: Abstraction has 387781 states and 420600 transitions. [2018-10-24 14:55:46,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 387781 states and 420600 transitions. [2018-10-24 14:55:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-24 14:55:46,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:46,779 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:55:46,779 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:46,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1826316818, now seen corresponding path program 1 times [2018-10-24 14:55:46,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:46,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:46,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-24 14:55:47,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:47,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:47,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:47,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:47,031 INFO L87 Difference]: Start difference. First operand 387781 states and 420600 transitions. Second operand 3 states. [2018-10-24 14:55:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:51,652 INFO L93 Difference]: Finished difference Result 723348 states and 786210 transitions. [2018-10-24 14:55:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:51,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2018-10-24 14:55:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:52,122 INFO L225 Difference]: With dead ends: 723348 [2018-10-24 14:55:52,123 INFO L226 Difference]: Without dead ends: 335569 [2018-10-24 14:55:52,358 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-24 14:55:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335569 states. [2018-10-24 14:55:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335569 to 332268. [2018-10-24 14:55:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332268 states. [2018-10-24 14:55:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332268 states to 332268 states and 360060 transitions. [2018-10-24 14:55:58,046 INFO L78 Accepts]: Start accepts. Automaton has 332268 states and 360060 transitions. Word has length 393 [2018-10-24 14:55:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:58,046 INFO L481 AbstractCegarLoop]: Abstraction has 332268 states and 360060 transitions. [2018-10-24 14:55:58,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 332268 states and 360060 transitions. [2018-10-24 14:55:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-24 14:55:58,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:58,157 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:58,157 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:58,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1588649335, now seen corresponding path program 1 times [2018-10-24 14:55:58,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:58,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-24 14:55:59,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:59,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:55:59,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:59,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:59,529 INFO L87 Difference]: Start difference. First operand 332268 states and 360060 transitions. Second operand 3 states. [2018-10-24 14:56:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:04,445 INFO L93 Difference]: Finished difference Result 853198 states and 922511 transitions. [2018-10-24 14:56:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:04,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-10-24 14:56:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:05,335 INFO L225 Difference]: With dead ends: 853198 [2018-10-24 14:56:05,336 INFO L226 Difference]: Without dead ends: 520932 [2018-10-24 14:56:05,578 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-24 14:56:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520932 states. [2018-10-24 14:56:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520932 to 520926. [2018-10-24 14:56:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520926 states. [2018-10-24 14:56:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520926 states to 520926 states and 562366 transitions. [2018-10-24 14:56:19,842 INFO L78 Accepts]: Start accepts. Automaton has 520926 states and 562366 transitions. Word has length 396 [2018-10-24 14:56:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:19,843 INFO L481 AbstractCegarLoop]: Abstraction has 520926 states and 562366 transitions. [2018-10-24 14:56:19,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 520926 states and 562366 transitions. [2018-10-24 14:56:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-24 14:56:20,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:20,017 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:56:20,018 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:20,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1331815661, now seen corresponding path program 1 times [2018-10-24 14:56:20,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:20,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 14:56:20,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:20,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:20,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:20,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:20,400 INFO L87 Difference]: Start difference. First operand 520926 states and 562366 transitions. Second operand 3 states. [2018-10-24 14:56:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:27,926 INFO L93 Difference]: Finished difference Result 1325610 states and 1430525 transitions. [2018-10-24 14:56:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:27,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2018-10-24 14:56:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:28,964 INFO L225 Difference]: With dead ends: 1325610 [2018-10-24 14:56:28,965 INFO L226 Difference]: Without dead ends: 804686 [2018-10-24 14:56:29,239 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-24 14:56:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804686 states. [2018-10-24 14:56:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804686 to 804276. [2018-10-24 14:56:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804276 states. [2018-10-24 14:56:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804276 states to 804276 states and 864196 transitions. [2018-10-24 14:56:57,771 INFO L78 Accepts]: Start accepts. Automaton has 804276 states and 864196 transitions. Word has length 405 [2018-10-24 14:56:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:57,771 INFO L481 AbstractCegarLoop]: Abstraction has 804276 states and 864196 transitions. [2018-10-24 14:56:57,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 804276 states and 864196 transitions. [2018-10-24 14:56:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-24 14:56:57,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:57,930 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, 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, 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] [2018-10-24 14:56:57,930 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:57,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1212429337, now seen corresponding path program 1 times [2018-10-24 14:56:57,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:57,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:57,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-24 14:56:58,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:58,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:58,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:58,345 INFO L87 Difference]: Start difference. First operand 804276 states and 864196 transitions. Second operand 4 states. [2018-10-24 14:57:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:07,627 INFO L93 Difference]: Finished difference Result 1649230 states and 1771756 transitions. [2018-10-24 14:57:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:07,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2018-10-24 14:57:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-10-24 14:57:10,045 INFO L225 Difference]: With dead ends: 1649230 [2018-10-24 14:57:10,045 INFO L226 Difference]: Without dead ends: 844956 [2018-10-24 14:57:10,222 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-24 14:57:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844956 states. [2018-10-24 14:57:10,710 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:57:10,714 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:57:10,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:57:10 BoogieIcfgContainer [2018-10-24 14:57:10,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:57:10,715 INFO L168 Benchmark]: Toolchain (without parser) took 198803.19 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:10,716 INFO L168 Benchmark]: CDTParser took 1.02 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-24 14:57:10,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1208.90 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-24 14:57:10,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -883.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:10,718 INFO L168 Benchmark]: Boogie Preprocessor took 150.14 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:10,719 INFO L168 Benchmark]: RCFGBuilder took 5412.65 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: 271.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:10,719 INFO L168 Benchmark]: TraceAbstraction took 191705.75 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:10,724 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02 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 1208.90 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 321.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -883.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.14 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5412.65 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: 271.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191705.75 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1506]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1506). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 191.6s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 95.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5315 SDtfs, 9710 SDslu, 2957 SDs, 0 SdLazy, 18180 SolverSat, 3594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804276occurred in iteration=18, 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: 84.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 17076 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 5580 NumberOfCodeBlocks, 5580 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5560 ConstructedInterpolants, 0 QuantifiedInterpolants, 4763674 SizeOfPredicates, 1 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 3746/3750 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown