java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:57:46,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:57:46,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:57:46,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:57:46,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:57:46,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:57:46,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:57:46,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:57:46,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:57:46,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:57:46,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:57:46,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:57:46,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:57:46,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:57:46,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:57:46,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:57:46,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:57:46,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:57:46,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:57:46,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:57:46,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:57:46,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:57:46,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:57:46,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:57:46,399 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:57:46,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:57:46,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:57:46,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:57:46,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:57:46,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:57:46,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:57:46,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:57:46,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:57:46,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:57:46,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:57:46,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:57:46,407 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:57:46,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:57:46,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:57:46,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:57:46,424 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:57:46,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:57:46,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:57:46,425 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:57:46,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:57:46,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:57:46,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:57:46,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:57:46,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:57:46,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:57:46,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:57:46,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:57:46,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:57:46,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:57:46,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:57:46,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:57:46,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:57:46,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:57:46,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:57:46,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:57:46,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:57:46,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:57:46,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:57:46,429 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:57:46,429 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:57:46,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:57:46,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:57:46,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:57:46,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:57:46,500 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:57:46,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-11-06 19:57:46,560 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb3a3c9b5/8e860655c24442d8b441edc28214b86c/FLAGaf81da152 [2018-11-06 19:57:47,315 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:57:47,316 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-11-06 19:57:47,337 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb3a3c9b5/8e860655c24442d8b441edc28214b86c/FLAGaf81da152 [2018-11-06 19:57:47,362 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb3a3c9b5/8e860655c24442d8b441edc28214b86c [2018-11-06 19:57:47,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:57:47,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:57:47,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:57:47,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:57:47,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:57:47,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:57:47" (1/1) ... [2018-11-06 19:57:47,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:47, skipping insertion in model container [2018-11-06 19:57:47,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:57:47" (1/1) ... [2018-11-06 19:57:47,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:57:47,488 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:57:48,201 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:57:48,207 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:57:48,504 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:57:48,529 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:57:48,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48 WrapperNode [2018-11-06 19:57:48,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:57:48,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:57:48,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:57:48,532 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:57:48,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:57:48,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:57:48,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:57:48,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:57:48,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:48,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:49,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... [2018-11-06 19:57:49,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:57:49,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:57:49,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:57:49,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:57:49,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:57:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:57:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:57:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:57:54,725 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:57:54,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:57:54 BoogieIcfgContainer [2018-11-06 19:57:54,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:57:54,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:57:54,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:57:54,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:57:54,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:57:47" (1/3) ... [2018-11-06 19:57:54,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d5343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:57:54, skipping insertion in model container [2018-11-06 19:57:54,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:57:48" (2/3) ... [2018-11-06 19:57:54,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d5343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:57:54, skipping insertion in model container [2018-11-06 19:57:54,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:57:54" (3/3) ... [2018-11-06 19:57:54,736 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label36_true-unreach-call.c [2018-11-06 19:57:54,747 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:57:54,759 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:57:54,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:57:54,824 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:57:54,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:57:54,825 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:57:54,825 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:57:54,825 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:57:54,825 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:57:54,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:57:54,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:57:54,826 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:57:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:57:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 19:57:54,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:54,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:54,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:54,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1071522756, now seen corresponding path program 1 times [2018-11-06 19:57:54,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:54,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:54,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:55,734 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:57:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:57:55,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:57:55,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:55,867 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:57:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:59,344 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-11-06 19:57:59,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:57:59,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-06 19:57:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:59,375 INFO L225 Difference]: With dead ends: 1075 [2018-11-06 19:57:59,376 INFO L226 Difference]: Without dead ends: 765 [2018-11-06 19:57:59,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-06 19:57:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-11-06 19:57:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-06 19:57:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-11-06 19:57:59,485 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 180 [2018-11-06 19:57:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:59,486 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-11-06 19:57:59,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-11-06 19:57:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:57:59,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:59,493 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:59,493 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:59,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1664876221, now seen corresponding path program 1 times [2018-11-06 19:57:59,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:59,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:59,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:59,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:57:59,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:59,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:57:59,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:59,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:59,649 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-11-06 19:58:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:01,923 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-11-06 19:58:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:01,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-06 19:58:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:01,931 INFO L225 Difference]: With dead ends: 1465 [2018-11-06 19:58:01,931 INFO L226 Difference]: Without dead ends: 947 [2018-11-06 19:58:01,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-11-06 19:58:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-11-06 19:58:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-11-06 19:58:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-11-06 19:58:01,977 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 189 [2018-11-06 19:58:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:01,977 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-11-06 19:58:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-11-06 19:58:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-06 19:58:01,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:01,982 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:01,983 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:01,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1680988393, now seen corresponding path program 1 times [2018-11-06 19:58:01,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:01,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:01,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:58:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:02,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:02,307 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-11-06 19:58:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:05,481 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-11-06 19:58:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:05,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-11-06 19:58:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:05,494 INFO L225 Difference]: With dead ends: 2693 [2018-11-06 19:58:05,494 INFO L226 Difference]: Without dead ends: 1764 [2018-11-06 19:58:05,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-11-06 19:58:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-11-06 19:58:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-11-06 19:58:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-11-06 19:58:05,543 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 197 [2018-11-06 19:58:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:05,544 INFO L480 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-11-06 19:58:05,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-11-06 19:58:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-06 19:58:05,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:05,552 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:05,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:05,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1712813493, now seen corresponding path program 1 times [2018-11-06 19:58:05,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:05,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:58:05,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:05,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:05,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:05,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:05,722 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-11-06 19:58:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:07,716 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-11-06 19:58:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:07,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-06 19:58:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:07,738 INFO L225 Difference]: With dead ends: 5132 [2018-11-06 19:58:07,738 INFO L226 Difference]: Without dead ends: 3386 [2018-11-06 19:58:07,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-11-06 19:58:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-11-06 19:58:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-11-06 19:58:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-11-06 19:58:07,833 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 204 [2018-11-06 19:58:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:07,834 INFO L480 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-11-06 19:58:07,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-11-06 19:58:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-06 19:58:07,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:07,846 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:07,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:07,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -634898385, now seen corresponding path program 1 times [2018-11-06 19:58:07,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:58:08,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:08,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:08,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:08,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:08,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:08,160 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-11-06 19:58:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:09,684 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-11-06 19:58:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:09,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-06 19:58:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:09,716 INFO L225 Difference]: With dead ends: 10035 [2018-11-06 19:58:09,717 INFO L226 Difference]: Without dead ends: 6652 [2018-11-06 19:58:09,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-11-06 19:58:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-11-06 19:58:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-06 19:58:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-11-06 19:58:09,844 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 211 [2018-11-06 19:58:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:09,844 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-11-06 19:58:09,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-11-06 19:58:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-06 19:58:09,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:09,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:09,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:09,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1018946693, now seen corresponding path program 1 times [2018-11-06 19:58:09,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:09,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:09,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:10,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:10,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:10,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:10,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:10,038 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-11-06 19:58:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:11,822 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-11-06 19:58:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:11,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-11-06 19:58:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:11,855 INFO L225 Difference]: With dead ends: 13297 [2018-11-06 19:58:11,856 INFO L226 Difference]: Without dead ends: 6650 [2018-11-06 19:58:11,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-11-06 19:58:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-11-06 19:58:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-06 19:58:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-11-06 19:58:11,990 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 211 [2018-11-06 19:58:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:11,990 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-11-06 19:58:11,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-11-06 19:58:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:58:12,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:12,006 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:12,006 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:12,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1841420693, now seen corresponding path program 1 times [2018-11-06 19:58:12,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:12,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:58:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:12,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:12,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:12,188 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-11-06 19:58:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:12,963 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-11-06 19:58:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:12,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-06 19:58:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:12,990 INFO L225 Difference]: With dead ends: 13264 [2018-11-06 19:58:12,990 INFO L226 Difference]: Without dead ends: 6617 [2018-11-06 19:58:12,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-11-06 19:58:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-11-06 19:58:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-11-06 19:58:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-11-06 19:58:13,101 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-11-06 19:58:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:13,101 INFO L480 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-11-06 19:58:13,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-11-06 19:58:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-06 19:58:13,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:13,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:13,116 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:13,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash -197633740, now seen corresponding path program 1 times [2018-11-06 19:58:13,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:13,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:13,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:13,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:13,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:13,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:13,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:13,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:13,413 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-11-06 19:58:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:14,762 INFO L93 Difference]: Finished difference Result 15690 states and 19149 transitions. [2018-11-06 19:58:14,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:14,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-11-06 19:58:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:14,782 INFO L225 Difference]: With dead ends: 15690 [2018-11-06 19:58:14,782 INFO L226 Difference]: Without dead ends: 9075 [2018-11-06 19:58:14,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2018-11-06 19:58:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 9074. [2018-11-06 19:58:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2018-11-06 19:58:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10935 transitions. [2018-11-06 19:58:14,909 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10935 transitions. Word has length 222 [2018-11-06 19:58:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:14,909 INFO L480 AbstractCegarLoop]: Abstraction has 9074 states and 10935 transitions. [2018-11-06 19:58:14,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10935 transitions. [2018-11-06 19:58:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-06 19:58:14,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:14,923 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:14,924 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:14,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1273676320, now seen corresponding path program 1 times [2018-11-06 19:58:14,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:14,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:14,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:14,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:15,272 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-06 19:58:15,509 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:58:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:58:15,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:15,551 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:15,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:15,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:58:15,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:15,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:58:15,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:58:15,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:58:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:58:15,925 INFO L87 Difference]: Start difference. First operand 9074 states and 10935 transitions. Second operand 7 states. [2018-11-06 19:58:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:20,830 INFO L93 Difference]: Finished difference Result 34490 states and 42017 transitions. [2018-11-06 19:58:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:58:20,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2018-11-06 19:58:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:20,879 INFO L225 Difference]: With dead ends: 34490 [2018-11-06 19:58:20,879 INFO L226 Difference]: Without dead ends: 25418 [2018-11-06 19:58:20,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:58:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25418 states. [2018-11-06 19:58:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25418 to 25412. [2018-11-06 19:58:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25412 states. [2018-11-06 19:58:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25412 states to 25412 states and 28705 transitions. [2018-11-06 19:58:21,202 INFO L78 Accepts]: Start accepts. Automaton has 25412 states and 28705 transitions. Word has length 230 [2018-11-06 19:58:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:21,203 INFO L480 AbstractCegarLoop]: Abstraction has 25412 states and 28705 transitions. [2018-11-06 19:58:21,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:58:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 25412 states and 28705 transitions. [2018-11-06 19:58:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-11-06 19:58:21,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:21,242 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:21,242 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:21,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash 582135979, now seen corresponding path program 1 times [2018-11-06 19:58:21,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 19:58:21,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:21,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:21,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:21,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:21,681 INFO L87 Difference]: Start difference. First operand 25412 states and 28705 transitions. Second operand 4 states. [2018-11-06 19:58:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:24,239 INFO L93 Difference]: Finished difference Result 50218 states and 56784 transitions. [2018-11-06 19:58:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:24,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-11-06 19:58:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:24,281 INFO L225 Difference]: With dead ends: 50218 [2018-11-06 19:58:24,282 INFO L226 Difference]: Without dead ends: 24808 [2018-11-06 19:58:24,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24808 states. [2018-11-06 19:58:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24808 to 24797. [2018-11-06 19:58:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24797 states. [2018-11-06 19:58:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24797 states to 24797 states and 27813 transitions. [2018-11-06 19:58:24,582 INFO L78 Accepts]: Start accepts. Automaton has 24797 states and 27813 transitions. Word has length 321 [2018-11-06 19:58:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:24,583 INFO L480 AbstractCegarLoop]: Abstraction has 24797 states and 27813 transitions. [2018-11-06 19:58:24,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 24797 states and 27813 transitions. [2018-11-06 19:58:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-06 19:58:24,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:24,615 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:24,615 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:24,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1125602268, now seen corresponding path program 1 times [2018-11-06 19:58:24,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:24,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:24,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-06 19:58:24,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:24,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:24,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:24,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:24,913 INFO L87 Difference]: Start difference. First operand 24797 states and 27813 transitions. Second operand 4 states. [2018-11-06 19:58:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:26,898 INFO L93 Difference]: Finished difference Result 51849 states and 58266 transitions. [2018-11-06 19:58:26,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:26,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-11-06 19:58:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:26,933 INFO L225 Difference]: With dead ends: 51849 [2018-11-06 19:58:26,933 INFO L226 Difference]: Without dead ends: 27054 [2018-11-06 19:58:26,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27054 states. [2018-11-06 19:58:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27054 to 27047. [2018-11-06 19:58:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27047 states. [2018-11-06 19:58:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27047 states to 27047 states and 30335 transitions. [2018-11-06 19:58:27,244 INFO L78 Accepts]: Start accepts. Automaton has 27047 states and 30335 transitions. Word has length 342 [2018-11-06 19:58:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:27,244 INFO L480 AbstractCegarLoop]: Abstraction has 27047 states and 30335 transitions. [2018-11-06 19:58:27,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27047 states and 30335 transitions. [2018-11-06 19:58:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-06 19:58:27,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:27,268 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:27,269 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:27,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1562798004, now seen corresponding path program 1 times [2018-11-06 19:58:27,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:27,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-06 19:58:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:27,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:27,503 INFO L87 Difference]: Start difference. First operand 27047 states and 30335 transitions. Second operand 3 states. [2018-11-06 19:58:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:28,886 INFO L93 Difference]: Finished difference Result 52660 states and 59076 transitions. [2018-11-06 19:58:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:28,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2018-11-06 19:58:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:28,915 INFO L225 Difference]: With dead ends: 52660 [2018-11-06 19:58:28,915 INFO L226 Difference]: Without dead ends: 25615 [2018-11-06 19:58:28,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25615 states. [2018-11-06 19:58:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25615 to 25612. [2018-11-06 19:58:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25612 states. [2018-11-06 19:58:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25612 states to 25612 states and 28117 transitions. [2018-11-06 19:58:29,179 INFO L78 Accepts]: Start accepts. Automaton has 25612 states and 28117 transitions. Word has length 363 [2018-11-06 19:58:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:29,179 INFO L480 AbstractCegarLoop]: Abstraction has 25612 states and 28117 transitions. [2018-11-06 19:58:29,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25612 states and 28117 transitions. [2018-11-06 19:58:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-06 19:58:29,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:29,199 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:29,199 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:29,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash -921422517, now seen corresponding path program 1 times [2018-11-06 19:58:29,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:58:29,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:29,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:29,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:29,731 INFO L87 Difference]: Start difference. First operand 25612 states and 28117 transitions. Second operand 4 states. [2018-11-06 19:58:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:31,062 INFO L93 Difference]: Finished difference Result 99169 states and 109018 transitions. [2018-11-06 19:58:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:31,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-11-06 19:58:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:31,125 INFO L225 Difference]: With dead ends: 99169 [2018-11-06 19:58:31,126 INFO L226 Difference]: Without dead ends: 73559 [2018-11-06 19:58:31,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73559 states. [2018-11-06 19:58:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73559 to 48356. [2018-11-06 19:58:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48356 states. [2018-11-06 19:58:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48356 states to 48356 states and 53197 transitions. [2018-11-06 19:58:31,700 INFO L78 Accepts]: Start accepts. Automaton has 48356 states and 53197 transitions. Word has length 370 [2018-11-06 19:58:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:31,700 INFO L480 AbstractCegarLoop]: Abstraction has 48356 states and 53197 transitions. [2018-11-06 19:58:31,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 48356 states and 53197 transitions. [2018-11-06 19:58:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-11-06 19:58:31,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:31,723 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:31,723 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:31,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:31,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1816538621, now seen corresponding path program 1 times [2018-11-06 19:58:31,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:31,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:31,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:32,216 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:58:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-11-06 19:58:32,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:32,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:58:32,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:58:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:58:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:58:32,313 INFO L87 Difference]: Start difference. First operand 48356 states and 53197 transitions. Second operand 5 states. [2018-11-06 19:58:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:34,868 INFO L93 Difference]: Finished difference Result 134847 states and 148793 transitions. [2018-11-06 19:58:34,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:58:34,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-11-06 19:58:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:34,968 INFO L225 Difference]: With dead ends: 134847 [2018-11-06 19:58:34,968 INFO L226 Difference]: Without dead ends: 86493 [2018-11-06 19:58:35,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:58:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86493 states. [2018-11-06 19:58:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86493 to 84417. [2018-11-06 19:58:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84417 states. [2018-11-06 19:58:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84417 states to 84417 states and 92902 transitions. [2018-11-06 19:58:36,348 INFO L78 Accepts]: Start accepts. Automaton has 84417 states and 92902 transitions. Word has length 373 [2018-11-06 19:58:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:36,349 INFO L480 AbstractCegarLoop]: Abstraction has 84417 states and 92902 transitions. [2018-11-06 19:58:36,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:58:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 84417 states and 92902 transitions. [2018-11-06 19:58:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-11-06 19:58:36,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:36,374 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:36,375 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:36,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1602254634, now seen corresponding path program 1 times [2018-11-06 19:58:36,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:36,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:36,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 19:58:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:58:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:36,720 INFO L87 Difference]: Start difference. First operand 84417 states and 92902 transitions. Second operand 3 states. [2018-11-06 19:58:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:37,908 INFO L93 Difference]: Finished difference Result 199174 states and 218905 transitions. [2018-11-06 19:58:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:37,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-11-06 19:58:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:38,064 INFO L225 Difference]: With dead ends: 199174 [2018-11-06 19:58:38,065 INFO L226 Difference]: Without dead ends: 114759 [2018-11-06 19:58:38,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114759 states. [2018-11-06 19:58:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114759 to 114759. [2018-11-06 19:58:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114759 states. [2018-11-06 19:58:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114759 states to 114759 states and 125859 transitions. [2018-11-06 19:58:40,221 INFO L78 Accepts]: Start accepts. Automaton has 114759 states and 125859 transitions. Word has length 392 [2018-11-06 19:58:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:40,221 INFO L480 AbstractCegarLoop]: Abstraction has 114759 states and 125859 transitions. [2018-11-06 19:58:40,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 114759 states and 125859 transitions. [2018-11-06 19:58:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-11-06 19:58:40,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:40,298 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:40,298 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:40,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash 593917864, now seen corresponding path program 1 times [2018-11-06 19:58:40,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:40,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:40,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:40,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:40,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-11-06 19:58:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:40,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:40,734 INFO L87 Difference]: Start difference. First operand 114759 states and 125859 transitions. Second operand 3 states. [2018-11-06 19:58:41,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:41,828 INFO L93 Difference]: Finished difference Result 309033 states and 338482 transitions. [2018-11-06 19:58:41,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:41,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 693 [2018-11-06 19:58:41,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:42,113 INFO L225 Difference]: With dead ends: 309033 [2018-11-06 19:58:42,113 INFO L226 Difference]: Without dead ends: 194276 [2018-11-06 19:58:42,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194276 states. [2018-11-06 19:58:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194276 to 194274. [2018-11-06 19:58:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194274 states. [2018-11-06 19:58:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194274 states to 194274 states and 211398 transitions. [2018-11-06 19:58:46,047 INFO L78 Accepts]: Start accepts. Automaton has 194274 states and 211398 transitions. Word has length 693 [2018-11-06 19:58:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:46,047 INFO L480 AbstractCegarLoop]: Abstraction has 194274 states and 211398 transitions. [2018-11-06 19:58:46,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:58:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 194274 states and 211398 transitions. [2018-11-06 19:58:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-11-06 19:58:46,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:46,159 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:46,160 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:46,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 374868588, now seen corresponding path program 1 times [2018-11-06 19:58:46,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:46,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:46,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:46,730 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:58:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 732 proven. 29 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2018-11-06 19:58:49,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:49,096 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:49,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:49,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2018-11-06 19:58:49,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:49,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-11-06 19:58:49,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:58:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:58:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:58:49,830 INFO L87 Difference]: Start difference. First operand 194274 states and 211398 transitions. Second operand 11 states. [2018-11-06 19:59:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:09,450 INFO L93 Difference]: Finished difference Result 1596964 states and 1736457 transitions. [2018-11-06 19:59:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-06 19:59:09,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 695 [2018-11-06 19:59:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:22,034 INFO L225 Difference]: With dead ends: 1596964 [2018-11-06 19:59:22,034 INFO L226 Difference]: Without dead ends: 1402680 [2018-11-06 19:59:22,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 694 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-11-06 19:59:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402680 states. [2018-11-06 19:59:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402680 to 1317555. [2018-11-06 19:59:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317555 states. [2018-11-06 19:59:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317555 states to 1317555 states and 1434262 transitions. [2018-11-06 19:59:56,648 INFO L78 Accepts]: Start accepts. Automaton has 1317555 states and 1434262 transitions. Word has length 695 [2018-11-06 19:59:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:56,649 INFO L480 AbstractCegarLoop]: Abstraction has 1317555 states and 1434262 transitions. [2018-11-06 19:59:56,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:59:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1317555 states and 1434262 transitions. [2018-11-06 19:59:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-11-06 19:59:57,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:57,732 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:57,733 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:57,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 460198062, now seen corresponding path program 1 times [2018-11-06 19:59:57,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:57,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:57,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:57,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:57,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 966 proven. 40 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-11-06 20:00:00,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:00,445 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:00,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2018-11-06 20:00:01,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:01,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 20:00:01,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 20:00:01,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 20:00:01,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-11-06 20:00:01,190 INFO L87 Difference]: Start difference. First operand 1317555 states and 1434262 transitions. Second operand 14 states.