java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:53:13,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:53:13,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:53:13,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:53:13,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:53:13,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:53:13,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:53:13,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:53:13,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:53:13,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:53:13,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:53:13,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:53:13,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:53:13,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:53:13,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:53:13,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:53:13,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:53:13,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:53:13,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:53:13,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:53:13,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:53:13,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:53:13,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:53:13,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:53:13,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:53:13,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:53:13,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:53:13,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:53:13,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:53:13,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:53:13,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:53:13,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:53:13,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:53:13,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:53:13,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:53:13,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:53:13,475 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:53:13,502 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:53:13,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:53:13,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:53:13,504 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:53:13,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:53:13,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:53:13,505 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:53:13,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:53:13,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:53:13,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:53:13,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:53:13,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:53:13,507 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:53:13,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:53:13,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:53:13,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:53:13,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:53:13,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:53:13,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:53:13,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:13,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:53:13,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:53:13,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:53:13,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:53:13,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:53:13,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:53:13,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:53:13,512 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:53:13,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:53:13,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:53:13,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:53:13,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:53:13,604 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:53:13,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c [2018-10-23 18:53:13,665 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6c20748d1/897e88445baf406eb01d34c58ab39e84/FLAG74280eec3 [2018-10-23 18:53:14,333 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:53:14,334 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c [2018-10-23 18:53:14,356 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6c20748d1/897e88445baf406eb01d34c58ab39e84/FLAG74280eec3 [2018-10-23 18:53:14,377 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6c20748d1/897e88445baf406eb01d34c58ab39e84 [2018-10-23 18:53:14,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:53:14,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:53:14,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:14,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:53:14,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:53:14,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:14" (1/1) ... [2018-10-23 18:53:14,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3829398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:14, skipping insertion in model container [2018-10-23 18:53:14,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:14" (1/1) ... [2018-10-23 18:53:14,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:53:14,521 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:53:15,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:15,284 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:53:15,553 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:15,579 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:53:15,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15 WrapperNode [2018-10-23 18:53:15,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:15,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:15,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:53:15,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:53:15,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:15,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:53:15,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:53:15,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:53:15,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:15,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... [2018-10-23 18:53:16,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:53:16,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:53:16,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:53:16,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:53:16,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:16,091 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:53:16,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:53:16,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:53:21,798 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:53:21,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:21 BoogieIcfgContainer [2018-10-23 18:53:21,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:53:21,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:53:21,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:53:21,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:53:21,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:53:14" (1/3) ... [2018-10-23 18:53:21,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452a7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:21, skipping insertion in model container [2018-10-23 18:53:21,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:15" (2/3) ... [2018-10-23 18:53:21,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452a7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:21, skipping insertion in model container [2018-10-23 18:53:21,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:21" (3/3) ... [2018-10-23 18:53:21,810 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label19_true-unreach-call.c [2018-10-23 18:53:21,820 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:53:21,833 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:53:21,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:53:21,900 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:53:21,901 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:53:21,901 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:53:21,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:53:21,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:53:21,902 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:53:21,902 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:53:21,902 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:53:21,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:53:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:53:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-23 18:53:21,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:21,968 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:21,970 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:21,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1651979548, now seen corresponding path program 1 times [2018-10-23 18:53:21,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:22,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:22,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:23,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:23,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:23,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:23,055 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:53:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:26,794 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-23 18:53:26,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:26,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-23 18:53:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:26,823 INFO L225 Difference]: With dead ends: 1075 [2018-10-23 18:53:26,823 INFO L226 Difference]: Without dead ends: 765 [2018-10-23 18:53:26,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-23 18:53:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-23 18:53:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-23 18:53:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-23 18:53:26,963 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 188 [2018-10-23 18:53:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:26,965 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-23 18:53:26,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-23 18:53:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-23 18:53:26,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:26,982 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:26,982 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:26,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:26,983 INFO L82 PathProgramCache]: Analyzing trace with hash -415975069, now seen corresponding path program 1 times [2018-10-23 18:53:26,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:26,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:26,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:26,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:27,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:27,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:27,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:27,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:27,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:27,162 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-23 18:53:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:29,371 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-23 18:53:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:29,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-23 18:53:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:29,378 INFO L225 Difference]: With dead ends: 1465 [2018-10-23 18:53:29,379 INFO L226 Difference]: Without dead ends: 947 [2018-10-23 18:53:29,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-23 18:53:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-23 18:53:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-23 18:53:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-23 18:53:29,420 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 197 [2018-10-23 18:53:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:29,422 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-23 18:53:29,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-23 18:53:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-23 18:53:29,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:29,429 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:29,429 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:29,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash -386544841, now seen corresponding path program 1 times [2018-10-23 18:53:29,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:29,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:53:29,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:29,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:29,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:29,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:29,774 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-23 18:53:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:33,354 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-10-23 18:53:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:33,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-23 18:53:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:33,366 INFO L225 Difference]: With dead ends: 2683 [2018-10-23 18:53:33,366 INFO L226 Difference]: Without dead ends: 1754 [2018-10-23 18:53:33,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-10-23 18:53:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-10-23 18:53:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-23 18:53:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-10-23 18:53:33,406 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 205 [2018-10-23 18:53:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:33,406 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-10-23 18:53:33,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-10-23 18:53:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-23 18:53:33,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:33,412 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:33,413 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:33,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash -151169027, now seen corresponding path program 1 times [2018-10-23 18:53:33,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:33,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:33,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:53:33,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:33,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:33,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:33,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:33,561 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-10-23 18:53:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:35,017 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-10-23 18:53:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:35,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-23 18:53:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:35,037 INFO L225 Difference]: With dead ends: 5139 [2018-10-23 18:53:35,037 INFO L226 Difference]: Without dead ends: 3388 [2018-10-23 18:53:35,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-10-23 18:53:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-10-23 18:53:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-23 18:53:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-10-23 18:53:35,163 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 212 [2018-10-23 18:53:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:35,163 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-10-23 18:53:35,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-10-23 18:53:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-23 18:53:35,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:35,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:35,172 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:35,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1536549167, now seen corresponding path program 1 times [2018-10-23 18:53:35,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:35,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:35,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:35,453 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:53:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:35,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:35,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:35,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:35,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:35,491 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-10-23 18:53:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:38,669 INFO L93 Difference]: Finished difference Result 13364 states and 18287 transitions. [2018-10-23 18:53:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:38,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-10-23 18:53:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:38,713 INFO L225 Difference]: With dead ends: 13364 [2018-10-23 18:53:38,713 INFO L226 Difference]: Without dead ends: 9981 [2018-10-23 18:53:38,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2018-10-23 18:53:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 6649. [2018-10-23 18:53:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-23 18:53:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-10-23 18:53:38,867 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 215 [2018-10-23 18:53:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:38,868 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-10-23 18:53:38,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-10-23 18:53:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-23 18:53:38,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:38,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:38,886 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:38,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1248571006, now seen corresponding path program 1 times [2018-10-23 18:53:38,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:38,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:38,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:39,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:39,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:39,194 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-10-23 18:53:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:41,025 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-10-23 18:53:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:41,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2018-10-23 18:53:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:41,061 INFO L225 Difference]: With dead ends: 16563 [2018-10-23 18:53:41,061 INFO L226 Difference]: Without dead ends: 9916 [2018-10-23 18:53:41,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-10-23 18:53:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-10-23 18:53:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-10-23 18:53:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-10-23 18:53:41,231 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 216 [2018-10-23 18:53:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:41,231 INFO L481 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-10-23 18:53:41,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-10-23 18:53:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-23 18:53:41,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:41,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:41,252 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:41,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash 20567018, now seen corresponding path program 1 times [2018-10-23 18:53:41,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:41,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:41,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:41,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:41,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:41,472 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-10-23 18:53:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:43,455 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-10-23 18:53:43,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:43,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-10-23 18:53:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:43,483 INFO L225 Difference]: With dead ends: 24787 [2018-10-23 18:53:43,484 INFO L226 Difference]: Without dead ends: 14876 [2018-10-23 18:53:43,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-10-23 18:53:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-10-23 18:53:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-23 18:53:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-10-23 18:53:43,698 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 217 [2018-10-23 18:53:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:43,698 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-10-23 18:53:43,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-10-23 18:53:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-23 18:53:43,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:43,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:43,724 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:43,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash 796111806, now seen corresponding path program 1 times [2018-10-23 18:53:43,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:43,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:53:43,913 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:53:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:44,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:53:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:44,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:53:44,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:53:44,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:53:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:53:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:53:44,405 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 7 states. [2018-10-23 18:53:45,173 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-23 18:53:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:53,372 INFO L93 Difference]: Finished difference Result 85717 states and 107159 transitions. [2018-10-23 18:53:53,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 18:53:53,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-10-23 18:53:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:53,498 INFO L225 Difference]: With dead ends: 85717 [2018-10-23 18:53:53,498 INFO L226 Difference]: Without dead ends: 70847 [2018-10-23 18:53:53,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:53:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70847 states. [2018-10-23 18:53:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70847 to 70816. [2018-10-23 18:53:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70816 states. [2018-10-23 18:53:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70816 states to 70816 states and 83436 transitions. [2018-10-23 18:53:54,845 INFO L78 Accepts]: Start accepts. Automaton has 70816 states and 83436 transitions. Word has length 225 [2018-10-23 18:53:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:54,846 INFO L481 AbstractCegarLoop]: Abstraction has 70816 states and 83436 transitions. [2018-10-23 18:53:54,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:53:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 70816 states and 83436 transitions. [2018-10-23 18:53:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-23 18:53:54,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:54,949 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:54,950 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:54,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash 314218943, now seen corresponding path program 1 times [2018-10-23 18:53:54,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:54,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-23 18:53:55,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:55,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:55,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:55,150 INFO L87 Difference]: Start difference. First operand 70816 states and 83436 transitions. Second operand 3 states. [2018-10-23 18:53:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:57,302 INFO L93 Difference]: Finished difference Result 133770 states and 157213 transitions. [2018-10-23 18:53:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:57,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-23 18:53:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:57,377 INFO L225 Difference]: With dead ends: 133770 [2018-10-23 18:53:57,377 INFO L226 Difference]: Without dead ends: 62956 [2018-10-23 18:53:57,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2018-10-23 18:53:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2018-10-23 18:53:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-23 18:53:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 72561 transitions. [2018-10-23 18:53:58,203 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 72561 transitions. Word has length 233 [2018-10-23 18:53:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:58,204 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 72561 transitions. [2018-10-23 18:53:58,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 72561 transitions. [2018-10-23 18:53:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-23 18:53:58,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:58,217 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:58,217 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:58,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 919990258, now seen corresponding path program 1 times [2018-10-23 18:53:58,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:58,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:53:58,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:58,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:58,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:58,360 INFO L87 Difference]: Start difference. First operand 62956 states and 72561 transitions. Second operand 3 states. [2018-10-23 18:54:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:00,371 INFO L93 Difference]: Finished difference Result 125920 states and 145137 transitions. [2018-10-23 18:54:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:00,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-10-23 18:54:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:00,459 INFO L225 Difference]: With dead ends: 125920 [2018-10-23 18:54:00,459 INFO L226 Difference]: Without dead ends: 62966 [2018-10-23 18:54:00,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62966 states. [2018-10-23 18:54:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62966 to 62956. [2018-10-23 18:54:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-23 18:54:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 70389 transitions. [2018-10-23 18:54:01,656 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 70389 transitions. Word has length 236 [2018-10-23 18:54:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:01,656 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 70389 transitions. [2018-10-23 18:54:01,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 70389 transitions. [2018-10-23 18:54:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-23 18:54:01,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:01,671 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:01,671 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:01,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash 746073851, now seen corresponding path program 1 times [2018-10-23 18:54:01,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:01,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-23 18:54:01,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:01,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:01,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:01,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:01,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:01,913 INFO L87 Difference]: Start difference. First operand 62956 states and 70389 transitions. Second operand 4 states. [2018-10-23 18:54:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:03,615 INFO L93 Difference]: Finished difference Result 125910 states and 140776 transitions. [2018-10-23 18:54:03,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:03,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-10-23 18:54:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:03,694 INFO L225 Difference]: With dead ends: 125910 [2018-10-23 18:54:03,695 INFO L226 Difference]: Without dead ends: 62956 [2018-10-23 18:54:03,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2018-10-23 18:54:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2018-10-23 18:54:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-23 18:54:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 69803 transitions. [2018-10-23 18:54:04,465 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 69803 transitions. Word has length 268 [2018-10-23 18:54:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:04,465 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 69803 transitions. [2018-10-23 18:54:04,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 69803 transitions. [2018-10-23 18:54:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-23 18:54:04,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:04,483 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:04,483 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:04,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1304177161, now seen corresponding path program 1 times [2018-10-23 18:54:04,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:04,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:04,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:04,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:05,177 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-23 18:54:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:54:05,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:05,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 18:54:05,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:54:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:54:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:54:05,962 INFO L87 Difference]: Start difference. First operand 62956 states and 69803 transitions. Second operand 6 states. [2018-10-23 18:54:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:09,476 INFO L93 Difference]: Finished difference Result 247568 states and 271778 transitions. [2018-10-23 18:54:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 18:54:09,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2018-10-23 18:54:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:09,671 INFO L225 Difference]: With dead ends: 247568 [2018-10-23 18:54:09,671 INFO L226 Difference]: Without dead ends: 184614 [2018-10-23 18:54:09,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:54:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184614 states. [2018-10-23 18:54:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184614 to 184601. [2018-10-23 18:54:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184601 states. [2018-10-23 18:54:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184601 states to 184601 states and 201709 transitions. [2018-10-23 18:54:12,268 INFO L78 Accepts]: Start accepts. Automaton has 184601 states and 201709 transitions. Word has length 269 [2018-10-23 18:54:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:12,269 INFO L481 AbstractCegarLoop]: Abstraction has 184601 states and 201709 transitions. [2018-10-23 18:54:12,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:54:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 184601 states and 201709 transitions. [2018-10-23 18:54:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-23 18:54:12,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:12,289 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:12,289 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:12,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1987275286, now seen corresponding path program 1 times [2018-10-23 18:54:12,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:12,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:12,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-23 18:54:12,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:12,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:12,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:12,614 INFO L87 Difference]: Start difference. First operand 184601 states and 201709 transitions. Second operand 4 states. [2018-10-23 18:54:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:18,880 INFO L93 Difference]: Finished difference Result 676072 states and 737797 transitions. [2018-10-23 18:54:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:18,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-23 18:54:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:19,479 INFO L225 Difference]: With dead ends: 676072 [2018-10-23 18:54:19,479 INFO L226 Difference]: Without dead ends: 491473 [2018-10-23 18:54:19,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491473 states. [2018-10-23 18:54:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491473 to 491469. [2018-10-23 18:54:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491469 states. [2018-10-23 18:54:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491469 states to 491469 states and 535446 transitions. [2018-10-23 18:54:33,953 INFO L78 Accepts]: Start accepts. Automaton has 491469 states and 535446 transitions. Word has length 270 [2018-10-23 18:54:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:33,954 INFO L481 AbstractCegarLoop]: Abstraction has 491469 states and 535446 transitions. [2018-10-23 18:54:33,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 491469 states and 535446 transitions. [2018-10-23 18:54:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-23 18:54:33,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:33,974 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:33,974 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:33,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1412233061, now seen corresponding path program 1 times [2018-10-23 18:54:33,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:33,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:33,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:54:34,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:34,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:34,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:34,190 INFO L87 Difference]: Start difference. First operand 491469 states and 535446 transitions. Second operand 4 states. [2018-10-23 18:54:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:39,789 INFO L93 Difference]: Finished difference Result 1033233 states and 1126792 transitions. [2018-10-23 18:54:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:39,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-10-23 18:54:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:40,325 INFO L225 Difference]: With dead ends: 1033233 [2018-10-23 18:54:40,326 INFO L226 Difference]: Without dead ends: 541766 [2018-10-23 18:54:40,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541766 states. [2018-10-23 18:54:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541766 to 535109. [2018-10-23 18:54:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535109 states. [2018-10-23 18:54:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535109 states to 535109 states and 577854 transitions. [2018-10-23 18:54:49,967 INFO L78 Accepts]: Start accepts. Automaton has 535109 states and 577854 transitions. Word has length 292 [2018-10-23 18:54:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:49,967 INFO L481 AbstractCegarLoop]: Abstraction has 535109 states and 577854 transitions. [2018-10-23 18:54:49,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 535109 states and 577854 transitions. [2018-10-23 18:54:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-23 18:54:49,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:49,996 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:54:49,996 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:49,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash 19981777, now seen corresponding path program 1 times [2018-10-23 18:54:49,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:49,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:49,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:49,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:49,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 156 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:54:50,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:54:50,404 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:54:50,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:50,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:54:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-23 18:54:50,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:54:50,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:54:50,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:54:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:54:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:54:50,737 INFO L87 Difference]: Start difference. First operand 535109 states and 577854 transitions. Second operand 7 states. [2018-10-23 18:55:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:08,440 INFO L93 Difference]: Finished difference Result 1321746 states and 1433809 transitions. [2018-10-23 18:55:08,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 18:55:08,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2018-10-23 18:55:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:09,538 INFO L225 Difference]: With dead ends: 1321746 [2018-10-23 18:55:09,538 INFO L226 Difference]: Without dead ends: 786639 [2018-10-23 18:55:09,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-23 18:55:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786639 states. [2018-10-23 18:55:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786639 to 712980. [2018-10-23 18:55:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712980 states. [2018-10-23 18:55:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712980 states to 712980 states and 761918 transitions. [2018-10-23 18:55:21,496 INFO L78 Accepts]: Start accepts. Automaton has 712980 states and 761918 transitions. Word has length 344 [2018-10-23 18:55:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:21,496 INFO L481 AbstractCegarLoop]: Abstraction has 712980 states and 761918 transitions. [2018-10-23 18:55:21,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:55:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 712980 states and 761918 transitions. [2018-10-23 18:55:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-23 18:55:21,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:21,576 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:21,577 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:21,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash 221744449, now seen corresponding path program 1 times [2018-10-23 18:55:21,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:21,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:21,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-10-23 18:55:21,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:21,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:21,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:21,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:21,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:21,939 INFO L87 Difference]: Start difference. First operand 712980 states and 761918 transitions. Second operand 3 states. [2018-10-23 18:55:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:34,615 INFO L93 Difference]: Finished difference Result 1745912 states and 1861654 transitions. [2018-10-23 18:55:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:34,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2018-10-23 18:55:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:37,070 INFO L225 Difference]: With dead ends: 1745912 [2018-10-23 18:55:37,071 INFO L226 Difference]: Without dead ends: 1032934 [2018-10-23 18:55:37,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032934 states. [2018-10-23 18:55:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032934 to 1030429. [2018-10-23 18:55:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030429 states. [2018-10-23 18:55:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030429 states to 1030429 states and 1097027 transitions. [2018-10-23 18:55:53,464 INFO L78 Accepts]: Start accepts. Automaton has 1030429 states and 1097027 transitions. Word has length 437 [2018-10-23 18:55:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:53,464 INFO L481 AbstractCegarLoop]: Abstraction has 1030429 states and 1097027 transitions. [2018-10-23 18:55:53,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1030429 states and 1097027 transitions. [2018-10-23 18:55:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-23 18:55:53,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:53,568 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:53,568 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:53,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash 310016055, now seen corresponding path program 1 times [2018-10-23 18:55:53,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:53,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:53,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-23 18:55:53,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:53,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:53,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:53,943 INFO L87 Difference]: Start difference. First operand 1030429 states and 1097027 transitions. Second operand 3 states. [2018-10-23 18:56:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:08,592 INFO L93 Difference]: Finished difference Result 1821846 states and 1939170 transitions. [2018-10-23 18:56:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:08,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2018-10-23 18:56:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:11,156 INFO L225 Difference]: With dead ends: 1821846 [2018-10-23 18:56:11,156 INFO L226 Difference]: Without dead ends: 791419 [2018-10-23 18:56:11,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791419 states. [2018-10-23 18:56:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791419 to 791402. [2018-10-23 18:56:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791402 states. [2018-10-23 18:56:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791402 states to 791402 states and 840010 transitions. [2018-10-23 18:56:24,083 INFO L78 Accepts]: Start accepts. Automaton has 791402 states and 840010 transitions. Word has length 476 [2018-10-23 18:56:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:24,083 INFO L481 AbstractCegarLoop]: Abstraction has 791402 states and 840010 transitions. [2018-10-23 18:56:24,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 791402 states and 840010 transitions. [2018-10-23 18:56:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-23 18:56:24,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:24,217 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:56:24,217 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:24,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1640597198, now seen corresponding path program 1 times [2018-10-23 18:56:24,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:24,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:24,769 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 18:56:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-10-23 18:56:25,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:25,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:56:25,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:56:25,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:56:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:56:25,055 INFO L87 Difference]: Start difference. First operand 791402 states and 840010 transitions. Second operand 5 states.